Peter J. Cameron
Remoteness of permutation codes
Cameron, Peter J.; Gadouleau, Maximilien
Abstract
In this paper, we introduce a new parameter of a code, referred to as the remoteness, which can be viewed as a dual to the covering radius. Indeed, the remoteness is the minimum radius needed for a single ball to cover all codewords. After giving some general results about the remoteness, we then focus on the remoteness of permutation codes. We first derive upper and lower bounds on the minimum cardinality of a code with a given remoteness. We then study the remoteness of permutation groups. We show that the remoteness of transitive groups can only take two values, and we determine the remoteness of transitive groups of odd order. We finally show that the problem of determining the remoteness of a given transitive group is equivalent to determining the stability number of a related graph.
Citation
Cameron, P. J., & Gadouleau, M. (2012). Remoteness of permutation codes. European Journal of Combinatorics, 33(6), 1273-1285. https://doi.org/10.1016/j.ejc.2012.03.027
Journal Article Type | Article |
---|---|
Acceptance Date | Mar 9, 2012 |
Publication Date | Aug 1, 2012 |
Deposit Date | Mar 13, 2012 |
Publicly Available Date | Feb 5, 2016 |
Journal | European Journal of Combinatorics |
Print ISSN | 0195-6698 |
Publisher | Elsevier |
Peer Reviewed | Peer Reviewed |
Volume | 33 |
Issue | 6 |
Pages | 1273-1285 |
DOI | https://doi.org/10.1016/j.ejc.2012.03.027 |
Files
Accepted Journal Article
(330 Kb)
PDF
Publisher Licence URL
http://creativecommons.org/licenses/by-nc-nd/4.0/
Copyright Statement
© 2012 This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/
You might also like
Bent functions in the partial spread class generated by linear recurring sequences
(2022)
Journal Article
Expansive automata networks
(2020)
Journal Article
Fixing monotone Boolean networks asynchronously
(2020)
Journal Article
Elementary, finite and linear vN-regular cellular automata
(2020)
Journal Article
Complete Simulation of Automata Networks
(2019)
Journal Article
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search