Threshold Decoding
From MaRDI portal
Publication:4133522
DOI10.1007/978-3-7091-3008-7_2zbMATH Open0357.94005OpenAlexW4230137671MaRDI QIDQ4133522FDOQ4133522
Publication date: 1975
Published in: Coding and Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-7091-3008-7_2
Recommendations
Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Decoding (94B35)
Cited In (7)
- On the majority decodable distance of codes in filtrations of characteristic \(p>0\)
- Combinatorial \(S_ n\)-modules as codes
- Threshold decoding of cyclic codes
- Generalized threshold decoding of cyclic codes
- On the multiple threshold decoding of LDPC codes over \(\mathrm{GF}(q)\)
- Generalized threshold decoding of linear codes
- On Congruent Domination Number of Disjoint and One Point Union of Graphs
This page was built for publication: Threshold Decoding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4133522)