Codes from affine permutation groups

DOI10.1023/A:1008315701179MaRDI QIDQ1273537zbMATH OpenOpenAlexFDO

Authors 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

affine permutation groupbinary codeminimum distance

Mathematics Subject Classification ID

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

Review text

The maximum cardinality of a (linear or nonlinear) binary code of length \(n\) and minimum Hamming distance \(d\) is denoted by \(A(n,d)\). The author constructs codes that lead to improved lower bounds on \(A(n,d)\). The codes are found by stochastic computer search. A permutation group under which a code is invariant is prescribed before the search. The permutation groups used are mainly affine groups. The new bounds are: \(A(22,10) \geq 50\), \(A(23,10) \geq 76\), \(A(25,10) \geq 166\), \(A(26,10) \geq 270\), \(A(29,10) \geq 1460\), and \(A(28,12) \geq 178\).

Recommendations

• scientific article; zbMATH DE number 851666
• scientific article; zbMATH DE number 1188979
• scientific article; zbMATH DE number 953209
• The permutation group of affine-invariant extended cyclic codes
• Affine Reflection Group Codes
• Permutation groups and binary self-orthogonal codes
• On the permutation groups of cyclic codes
• Group code structures of affine-invariant codes
• Representing group codes as permutation codes
• Error-correcting codes from permutation groups

Cited in

(12)

• Increasing the minimum distance of codes by twisting
• Binary codes formed by functions with nontrivial inertia groups
• Some constant weight codes from primitive permutation groups
• New lower bounds on \(q\)-ary error-correcting codes
• Permutation codes invariant under isometries
• Constructing error-correcting binary codes using transitive permutation groups
• Two new four-error-correcting binary codes
• Affine Reflection Group Codes
• Doubly transitive groups of type pm(pm?1) and maximal nonbinary codes generated by them
• A simple proof of the improved Johnson bound for binary codes
• scientific article; zbMATH DE number 6396735 (Why is no real title available?)
• Affine MDS-codes on groups

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1273537)