Paper Info
Title
Constructing error-correcting binary codes using transitive permutation groups.
Abstract
Transitive permutation groups are recurrent in the study of automorphism groups of combinatorial objects. For binary error-correcting codes, groups are here considered that act transitively on the pairs of coordinates and coordinate values. By considering such groups in an exhaustive manner and carrying out computer searches, the following new bounds are obtained on A2(n,d), the maximum size of a binary code of length n and minimum distance d: A2(17,3)5632, A2(20,3)40960, A2(21,3)81920, A2(22,3)163840, A2(23,3)327680, A2(23,9)136, and A2(24,5)17920.
Year
DOI
Venue
2017
10.1016/j.dam.2017.08.022
Discrete Applied Mathematics
Keywords
DocType
Volume
Binary codes,Cliques,Error-correcting codes,Transitive groups
Journal
abs/1604.06022
Issue
ISSN
Citations 
C
0166-218X
2
PageRank 
References 
Authors
0.39
14
2
Name
Order
Citations
PageRank
Antti Laaksonen131.76
Patric R. J. Östergård260970.61