论文信息 - ON PLOTKIN-OPTIMAL CODES OVER FINITE FROBENIUS RINGS

ON PLOTKIN-OPTIMAL CODES OVER FINITE FROBENIUS RINGS

We study the Plotkin bound for codes over a finite Frobenius ring R equipped with the homogeneous weight. We show that for codes meeting the Plotkin bound, the distribution on R induced by projection onto a coordinate has an interesting property. We present several constructions of codes meeting the Plotkin bound and of Plotkin-optimal codes. We also investigate the relationship between Butson–Hadamard matrices and codes over R meeting the Plotkin bound.

Marcus Greferath | Gary McGuire | Michael E. O'Sullivan

[1] R. C. Bose,et al. A Note on a Result in the Theory of Code Construction , 1959, Inf. Control..

[2] O. Antoine,et al. Theory of Error-correcting Codes , 2022 .

[3] Jay A. Wood. Duality for modules over finite rings and applications to coding theory , 1999 .

[4] D. A. Drake. Partial λ-Geometries and Generalized Hadamard Matrices Over Groups , 1979, Canadian Journal of Mathematics.

[5] Marcus Greferath,et al. On bounds for codes over Frobenius rings under homogeneous weights , 2004, Discret. Math..

[6] Charalambos A. Charalambides,et al. Enumerative combinatorics , 2018, SIGA.

[7] Jennifer Wallis. On the existence of Hadamard matrices , 1976 .

[8] John L. Hayden,et al. Generalized Hadamard Matrices , 1997, Des. Codes Cryptogr..

[9] Morris Plotkin,et al. Binary codes with specified minimum distance , 1960, IRE Trans. Inf. Theory.

[10] T. Honold,et al. Characterization of finite Frobenius rings , 2001 .

[11] Asha Rao,et al. Cocyclic simplex codes of type alpha over Z4 and Z2s , 2004 .

[12] J. Seberry. On the Existence of Hadamard Matrices , 1976, J. Comb. Theory, Ser. A.

[13] Marcus Greferath,et al. Finite-Ring Combinatorics and MacWilliams' Equivalence Theorem , 2000, J. Comb. Theory A.

[14] Jennifer Seberry,et al. The Strong Kronecker Product , 1994, J. Comb. Theory, Ser. A.