Book ChapterDOI
On the inherent intractability of soft decision decoding of linear codes
J. Fang,G. Cohen,Philippe Godlewski,G. Battail +3 more
- pp 141-149
Reads0
Chats0
About:
The article was published on 1988-06-01. It has received 7 citations till now. The article focuses on the topics: Sequential decoding & List decoding.read more
Citations
More filters
Proceedings ArticleDOI
Algorithmic complexity in coding theory and the minimum distance problem
TL;DR: It is shown that the problem of computing the minimum distance of a linear code is NP-hard, and the corresponding deci~"on problem is W-complete, which constitutes a proof of the conjecture Bedekamp, McEliece,vanTilborg, dating back to 1978.
Journal ArticleDOI
Reliability-Based Soft-Decision Decoding With Multiple Biases
W. Jin,Marc P. C. Fossorier +1 more
TL;DR: This new reliability-based soft-decision decoding algorithm makes use of multiple information sets in a stochastic way and produces a more efficient MRB reprocessing type algorithm to achieve near maximum-likelihood decoding (MLD) performance with a proper choice of the bias value.
Journal ArticleDOI
Practical entanglement distillation scheme using recurrence method and quantum low density parity check codes
H. F. Chau,K. H. Ho +1 more
TL;DR: The performance of the recurrence method is analyzed, with its final random hashing or breeding procedure being replaced by various efficiently decodable quantum codes, and a certain adaptive quantum low density parity check (QLDPC) code is found to give the highest yield for Werner states over a wide range of noise level.
Posted Content
Practical Entanglement Distillation Scheme Using Recurrence Method And Quantum Low Density Parity Check Codes
H. F. Chau,K. H. Ho +1 more
TL;DR: In this paper, the performance of the recurrence method, a well-known entanglement distillation scheme, with its final random hashing or breeding procedure being replaced by various efficiently decodable quantum codes was analyzed.
Book ChapterDOI
Generating codewords in real space: application to decoding
TL;DR: This work considers maximum-likelihood decoding of binary linear codes from the viewpoint of space complexity, and discusses the concept of projecting set, enabling MLD by a gradient-like algorithm, and some extensions.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Journal ArticleDOI
On the inherent intractability of certain coding problems (Corresp.)
TL;DR: The fact that the general decoding problem for linear codes and the general problem of finding the weights of a linear code are both NP-complete is shown strongly suggests, but does not rigorously imply, that no algorithm for either of these problems which runs in polynomial time exists.
Book
Principles of digital communication and coding
Andrew J. Viterbi,James K. Omura +1 more
TL;DR: The principles of digital communication and coding are presented and a practical application of these principles, called "Principles of Digital Communication and coding", are presented.
Journal ArticleDOI
A heuristic discussion of probabilistic decoding
TL;DR: The invited Profess01 Fano to commit to paprr his elegant but, unelaborate explanation of the principles of sequential decoding, a scheme which is currently contending for a position as the most practical implementation of Shannon’s theory of noisy communication channels.