(L,g)-codes and binary forms

MaRDI QIDQ1061097zbMATH OpenFDO

Authors A. L. Vishnevetskij

Publication date 1984

Published in Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

number of equivalence classes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cyclic codes (94B15)

Review text

A modification of the definition of (L,g)-codes makes it possible to obtain cyclicity and quasicyclicity criteria and to obtain bounds for the number of equivalence classes of a large family of codes. The canonical form of polynomial g is given for codes equivalent to cyclic codes, and also for codes with deg g\(=2,3\).

Recommendations

• scientific article; zbMATH DE number 3458475
• scientific article; zbMATH DE number 1188981
• scientific article; zbMATH DE number 4033665
• Binary quasi-cyclic Goppa codes
• Inequivalent cyclic codes of prime length (Corresp.)

Cited in

(3)

• Binomial coefficient codes over GF(2)
• Bilinear forms and linear codes
• scientific article; zbMATH DE number 3458475 (Why is no real title available?)

This page was built for publication: (L,g)-codes and binary forms

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