Another generalized Golomb-Posner code

DOI10.1109/18.52491MaRDI QIDQ3484764zbMATHOpenAlexFDO

Authors József Dénes, Gary L. Mullen, Stephan J. Suchower

Publication date 1990

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.52491

zbMATH Keywords

Latin squaresminimum distanceweight distributionfinite fieldGolomb-Posner codemutually orthogonal frequency squares

Mathematics Subject Classification ID

Separable extensions, Galois theory (12F10) Linear codes (general theory) (94B05)

Recommendations

• Orthogonal F-rectangles, orthogonal arrays, and codes
• Polynomial representation of complete sets of mutually orthogonal frequency squares of prime power order
• Generalized Latin squares. I
• scientific article; zbMATH DE number 16254
• Codes with a poset metric

Cited in

(1)

• Nonisomorphic complete sets of \(F\)-rectangles with prime power dimensions

This page was built for publication: Another generalized Golomb-Posner code

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