Shortening of codes

zbMATH Open0546.94017MaRDI QIDQ798612FDOQ798612

Authors: Victor A. Zinoviev, Simon Litsyn 

Publication date: 1984

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

Recommendations

• General code shortening construction
• Good linear codes of length 27 and 28 (Corresp.)
• Optimal binary one-error-correcting codes of length 10 have 72 codewords
• Construction of some binary linear codes of minimum distance five
• New binary codes from a chain of cyclic codes
• Two optimal one-error-correcting codes of length 13 that are not doubly shortened perfect codes
• scientific article; zbMATH DE number 1456812
• scientific article; zbMATH DE number 786186
• scientific article; zbMATH DE number 3859031
• scientific article; zbMATH DE number 4160649

zbMATH Keywords

shortening of codes

Mathematics Subject Classification ID

Other types of codes (94B60)

Cited In (5)

• Making the Long Code Shorter
• Determination of best shortened linear codes
• Reduced linear codes from cyclic ones
• Decomposing and shortening codes using automorphisms (Corresp.)
• Some shortened codes from linear codes constructed by defining sets

This page was built for publication: Shortening of codes

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