Codes from Affine Permutation Groups

    loading  Checking for direct PDF access through Ovid

Abstract

It is shown that A(22,10) ≥ 50, A(23,10) ≥ 76, A(25,10) ≥ 166, A(26,10) ≥ 270, A(29,10) ≥ 1460, and A(28,12) ≥ 178, where A(n, d) denotes the maximum cardinality of a binary code of length n and minimum Hamming distance d. The constructed codes are invariant under permutations of some affine (or closely related) permutation group and have been found using computer search.

Related Topics

    loading  Loading Related Articles