Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Symposium on Information Theory (ISIT)

Ellipsoidal coverings and error-free search in maximum likelihood decoding

Ilya I. Dumer

Published Nov 27, 2002• 0 citations
Publisher

Abstract

For general linear (n, k) codes, maximum likelihood decoding is performed by random search of error-free k-subsets. The lowest known complexity of soft-decision decoding is obtained.
DOI
10.1109/isit.1998.708972

Related papers

Information-set soft-decision decoding

Ilya I. Dumer

Information-set decoding is considered for soft decision channels. The sets of most plausible error patterns are represented as ellipsoids in Hamming spaces, and their minimum coverings are designed by random search. For general linear codes, maximum likelihood decoding with the lowest known complexity is obtained.

IEEE Information Theory Workshop (ITW)•Nov 27, 2002•3 citations

On maximum likelihood soft-decision decoding of binary linear codes

N.J.C. Lous, P.A.H. Bours, Henk C. A. van Tilborg

Two new implementations of a maximum-likelihood soft-decision decoding algorithm for binary linear codes are derived. Instead of checking only error patterns yielding a codeword when added to the rounded-off version of the received vector, these implementations principally consider all possible column patterns. Compared to known implementations, this allows a more efficient use of branching and bounding techniques.>

IEEE Transactions on Information Theory•Jan 1, 1993•28 citations

On maximum likelihood soft decision syndrome decoding

M.P.C. Fossorier, Shu Hwa Lin, J. Synders

Maximum likelihood decoding of binary linear block codes is addressed by combining the approaches of processing the generator matrix G and parity-check matrix H.

IEEE International Symposium on Information Theory (ISIT)•Nov 19, 2002•2 citations

Soft-Decision Decoding for Linear Codes : The Quest to Maximum Likelihood Decoding

Takuya Koumoto

IEICE technical report. Information theory•Nov 20, 2007•0 citations

Improvements in two soft decision maximum likelihood decoding algorithms for linear block codes

W. Stieritz, Jack K. Wolf

•Jan 1, 1977•0 citations

How often is hard-decision decoding enough?

Peter F. Swaszek, W. Jones

The problem of decoding binary linear block codes has received much attention; the two extremes are optimal, high-complexity soft-decision (or maximum-likelihood) decoding and lower performance, much lower complexity hard-decision (or algebraic) decoding. This article considers a class of decoders which first implements hard-decision decoding; second, tests to see if that is enough, that its result matches the result of soft-decision decoding; and third, continues to search if a match is not found. The advantage of such a testing procedure is that if the hard-decision decoding result is found to be enough (called a success for the test), then the computational effort expended by the decoder is low. The performance, as measured by the probability of a success, of a variety of simple tests of the hard-decision codeword are analyzed.

IEEE Transactions on Information Theory•May 1, 1998•15 citations
The problem of decoding binary linear block codes has received much attention; the two extremes are optimal, high-complexity soft-decision (or maximum-likelihood) decoding and lower performance, much lower complexity hard-decision (or algebraic) decoding. This article considers a class of decoders which first implements hard-decision decoding; second, tests to see if that is enough, that its result matches the result of soft-decision decoding; and third, continues to search if a match is not found. The advantage of such a testing procedure is that if the hard-decision decoding result is found to be enough (called a success for the test), then the computational effort expended by the decoder is low. The performance, as measured by the probability of a success, of a variety of simple tests of the hard-decision codeword are analyzed.