Determination of best shortened linear codes

DOI10.1109/26.476086MaRDI QIDQ2726620zbMATH OpenOpenAlexFDO

Authors G. Funk

Publication date 18 July 2001

Published in IEEE Transactions on Communications (Search for Journal in Brave)

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

zbMATH Keywords

BCH codesblock codeshortened codesbinary linear block codesmaximum distance codesresidual error characteristicsshortened block lengths

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• Linear block codes for error detection (Corresp.)
• Error detection capability of shortened Hamming codes and their dual codes.
• scientific article; zbMATH DE number 1188997
• Shortening of codes
• Class of shortened cyclic codes over GF(28) for byte-oriented systems

Cited in

(1)

• Communication on Inductively Coupled Channels: Overview and Challenges

This page was built for publication: Determination of best shortened linear codes

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