The Simplex Codes and Other Even-Weight Binary Linear Codes for Error Correction
From MaRDI portal
Publication:3546992
DOI10.1109/TIT.2004.836708zbMATH Open1239.94082OpenAlexW2158531360MaRDI QIDQ3546992FDOQ3546992
Authors: Tor Helleseth, Torleiv Kløve, Vladimir Levenshtein 
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2004.836708
Recommendations
- Binary Linear Codes That Are Optimal for Error Correction
- Error-Correction Capability of Binary Linear Codes
- scientific article; zbMATH DE number 2154102
- On the structure of linear recurrent error-control codes
- On Correctable Errors of Binary Linear Codes
- scientific article; zbMATH DE number 3225713
- scientific article
- scientific article; zbMATH DE number 3363428
- Error-Correcting Codes and<tex>$B_h$</tex>-Sequences
- Fundamentals of Error-Correcting Codes
Cited In (7)
- On the complete decoding of binary linear codes (Corresp.)
- Error probabilities for bounded distance decoding
- Reed-Muller Codes
- Error-Correction Capability of Binary Linear Codes
- The probabilities of right decoding for a channel with additive Gaussian noise and a binary symmetric channel with random choice of code words
- Title not available (Why is that?)
- On the performance of binary extremal self-dual codes
This page was built for publication: The Simplex Codes and Other Even-Weight Binary Linear Codes for Error Correction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546992)
