IEEE Transactions on Information Theory · 2015 · 25 citations · 17 references
Natural SciencesComputer ScienceMathematicsCombinatoricsCryptographyNumber TheoryCoding TheoryError-correcting CodesNumber-theoretic AlgorithmsBinary CodesCyclic CodesMinimum DistanceSelf-dual Codes
Using a method for constructing self-dual codes having an automorphism of odd prime order, we classify up to equivalence all binary self-dual codes with an automorphism of order 11 with 6 cycles and minimum distance 12. This classification gives new [72, 36, 12] codes with weight enumerator that was previously not obtained as well as many [66, 33, 12], [68, 34, 12], and [70, 35, 12] codes with new values of the parameters in their respective weight enumerators.
17
Shadow bounds for self-dual codes
Eric M. Rains · IEEE Transactions on Information Theory · 1998 · 244 citations