Results 241 to 250 of about 178,221 (275)
Vector Encoding of Phylogenetic Trees by Ordered Leaf Attachment. [PDF]
Bull Math BiolRichman DH, Zhang C, Matsen FA.
europepmc +1 more source
List Decoding of Insertions and Deletions [PDF]
IEEE Transactions on Information Theory, 2018 List decoding of insertions and deletions in the Levenshtein metric is considered. The Levenshtein distance between two sequences is the minimum number of insertions and deletions needed to turn one of the sequences into the other. In this paper, a Johnson-like upper bound on the maximum list size when list decoding in the Levenshtein metric is derived.
Antonia Wachter-Zeh
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On List Sequence Turbo Decoding
IEEE Transactions on Communications, 2005An algorithm for decoding Turbo codes that combines conventional Turbo decoding and list sequence maximum a posteriori probability decoding is presented and evaluated. Compared to previous results on this theme, performance improvements in the order of 0.7 dB are obtained for Turbo codes with 514-b pseudorandom interleaving at a frame error rate of 10 ...
C -E W Sundberg
exaly +2 more sources
2015 IEEE International Symposium on Information Theory (ISIT), 2015
The setup of a general channel is considered in the mismatched case, i.e., when the decoder uses a general decoding metric. An expression for the average error probability in list decoding with block length n, metric q n , list size enΘn and rate R, denoted e(n) qn (R, Θ n ), is established.
openaire +1 more source
The setup of a general channel is considered in the mismatched case, i.e., when the decoder uses a general decoding metric. An expression for the average error probability in list decoding with block length n, metric q n , list size enΘn and rate R, denoted e(n) qn (R, Θ n ), is established.
openaire +1 more source
IEEE Transactions on Communications, 1998
Summary: List decoding of turbo codes is analyzed under the assumption of a maximum-likelihood (ML) list decoder. It is shown that large asymptotic gains can be achieved on both the additive white Gaussian noise and fully interleaved flat Rayleigh-fading channels. It is also shown that the relative asymptotic gains for turbo codes are larger than those
K R Narayanan, G L Stüber
exaly +2 more sources
Summary: List decoding of turbo codes is analyzed under the assumption of a maximum-likelihood (ML) list decoder. It is shown that large asymptotic gains can be achieved on both the additive white Gaussian noise and fully interleaved flat Rayleigh-fading channels. It is also shown that the relative asymptotic gains for turbo codes are larger than those
K R Narayanan, G L Stüber
exaly +2 more sources
Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE, 2004
A list sequence (LS) maximum a posteriori probability (MAP) decoding algorithm for convolutional codes, that takes into account bitwise a priori probabilities and produces a rank ordered list of /spl Lscr/ sequence MAP estimates, can be obtained by modification of the metric increments of the serial list Viterbi algorithm.
Carl Fredrik Leanderson +1 more
openaire +1 more source
A list sequence (LS) maximum a posteriori probability (MAP) decoding algorithm for convolutional codes, that takes into account bitwise a priori probabilities and produces a rank ordered list of /spl Lscr/ sequence MAP estimates, can be obtained by modification of the metric increments of the serial list Viterbi algorithm.
Carl Fredrik Leanderson +1 more
openaire +1 more source
Combinatorial bounds for list decoding
IEEE Transactions on Information Theory, 2002Summary: Informally, an error-correcting code has ``nice'' list-decodability properties if every Hamming ball of ``large'' radius has a ``small'' number of codewords in it. We report linear codes with nontrivial list-decodability: i.e., codes of large rate that are nicely list-decodable, and codes of large distance that are not nicely list-decodable ...
Venkatesan Guruswami +3 more
openaire +2 more sources
A List-Decodable Code with Local Encoding and Decoding
Sixth International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing and First ACIS International Workshop on Self-Assembling Wireless Networks (SNPD/SAWN'05), 2005Guruswamy and Indyk (2004) have shown that there exists an error-correcting code for which list-decoding from a (1-/spl epsi/) fraction of errors can be done in linear time. We present a binary code for which list-decoding from a (1/2-/spl epsi/) fraction of errors can be done in polylog time. The size of the list of candidates for the correct codeword
openaire +1 more source
On the List Decodability of Burst Errors
IEEE Transactions on Information Theory, 2016Burst errors are a type of distortion in many data communications and data storage channels. In this paper, we consider the list decodability of codes for single burst error case and phased-burst error case independently. Firstly, we analyze the list decodability of random codes, and we show that the burst list decoding radius and the rate of random ...
openaire +1 more source