Codes from affine permutation groups

DOI10.1023/A:1008315701179zbMath0917.94016OpenAlexW1588052294MaRDI QIDQ1273537

Markku K. Kaikkonen

Publication date: 28 July 1999

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008315701179

zbMATH Keywords

minimum distancebinary codeaffine permutation group

Mathematics Subject Classification ID

Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Bounds on codes (94B65) Combinatorial codes (94B25)

Related Items (4)

Constructing error-correcting binary codes using transitive permutation groups ⋮ A SIMPLE PROOF OF THE IMPROVED JOHNSON BOUND FOR BINARY CODES ⋮ New lower bounds on \(q\)-ary error-correcting codes ⋮ Two new four-error-correcting binary codes

This page was built for publication: Codes from affine permutation groups