Optimal binary linear codes and Z/sub 4/-linearity

DOI10.1109/18.508844zbMATH Open0854.94012OpenAlexW1970293243MaRDI QIDQ4885722FDOQ4885722

Authors: Helge Elbrond Jensen, Sylvia Encheva 

Publication date: 22 January 1997

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

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

Recommendations

• NEW OPTIMAL LINEAR CODES OVER
• Classification of optimal linear \(\mathbb {Z}_4\) rate \(1/2\) codes of length \(\leq 8\).
• On the non Z/sub 4/-linearity of certain good binary codes
• Optimal quaternary linear rate-1/2 codes of length ≤ 18

zbMATH Keywords

codes over ringsbinary linear code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cited In (7)

• Title not available (Why is that?)
• On optimal linear codes of dimension 4
• Title not available (Why is that?)
• Binary linear codes via 4D discrete Ihara-Selberg function
• Classification of optimal linear \(\mathbb {Z}_4\) rate \(1/2\) codes of length \(\leq 8\).
• Optimal biphase sequences with large linear complexity derived from sequences over Z/sub 4/
• NEW OPTIMAL LINEAR CODES OVER

This page was built for publication: Optimal binary linear codes and Z/sub 4/-linearity

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