Alexander Barg, Evgueni Krouk, Henk C. A. van Tilborg  Home/Search
Context
Related
| belllabs.com/cm/ms/who/a...decod.ps.gz belllabs.com/who/abarg/p...decod.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: belllabs.com/cm/ms/w...preprints (more) From: belllabs.com/who/aba...preprints (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We suggest a decoding algorithm of q-ary linear codes, which we call supercode decoding. It ensures the error probability that approaches the error probability of minimumdistance decoding as the length of the code grows. For n !1 the algorithm has the maximum-likelihood performance. The asymptotic complexity of supercode decoding is exponentially smaller than the complexity of all other methods known. The algorithm develops the ideas of covering-set decoding and split syndrome decoding. Index ... (Update)
Active bibliography (related documents): More All
6.3: Complexity Issues in Coding Theory - Barg (1997) (Correct)
0.7: Soft Decision Decoding Using Punctured Codes - Dumer (Correct)
0.6: Function Hiding Based on Error Correcting Codes - Loureiro, Molva (1999) (Correct)
Similar documents based on text: More All
0.4: Syndrome Decoding Problem For Rank Distance Codes - Chabaud, Stern (Correct)
0.2: The Correspondence Between Projective Codes and 2-weight Codes - Brouwer, Van Eupen (1997) (Correct)
0.1: The Parameterized Complexity of Some Fundamental Problems in.. - Downey, Fellows (Correct)
BibTeX entry: (Update)
@misc{ barg-complexity,
author = "Alexander Barg and Evgueni Krouk and Henk C. A. van Tilborg",
title = "On the Complexity of Minimum Distance Decoding of Long Linear Codes",
url = "citeseer.ist.psu.edu/barg99complexity.html" }
Citations (may not include all citations):3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
2003 The Art of Computer Programming (context) - Knuth - 1973
1450 The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
341 Low-Density Parity-Check Codes (context) - Gallager - 1963
73 the inherent intractability of certain coding problems (context) - Berlekamp, McEliece et al. - 1978
11 Error-Correcting Coding for Digital Communication (context) - Clark, Cain - 1981
11 Decoding linear block codes for minimizing word error rate (context) - Hwang - 1979
10 Complexity issues in coding theory - Barg - 1998
10 A new algorithm for finding minimumweight words in a linear .. - Canteaut, Chabaud - 1998
7 Minimal permutation sets for decoding the binary Golay code (context) - Gordon - 1982
3 Complexity of decoding for linear codes (context) - Evseev - 1983
3 Lower asymptotic bound on the number of linear code words in.. (context) - Blinovskii - 1987
3 A new approach to the general minimum distance decoding prob.. (context) - Levitin, Hartmann - 1985
2 Decoding by generalized information sets (context) - Krouk, Fedorenko - 1995
2 The hardness of approximating optima in lattices, codes, and.. (context) - Arora, Babai et al. - 1993
2 Concatenated decoding algorithm with incomplete inspection o.. (context) - Barg, Dumer - 1986
2 The complexity of information set decoding (context) - Coffey, Goodman - 1990
2 The use of information sets in decoding cyclic codes (context) - Prange - 1962
2 New approaches to reduced complexity decoding (context) - Coffey, Goodman et al. - 1991
2 Security-analysis of a class of cryptosystems based on linea.. (context) - van Tilburg - 1994
2 Two decoding algorithms for linear codes (context) - Dumer - 1989
2 Decoding complexity bound for linear block codes (context) - Krouk - 1989
2 Bounds to the trellis decoding complexity of linear block co.. (context) - Zyablov, Sidorenko - 1993
2 an and R. A. Games, "(n; k; t)-covering systems and errortra.. (context) - Ch - 1981
1 A permutation decoding of the (24, 12, 8) Golay code (context) - Wolfmann - 1983
1 THE COMPLEXITY OF MINIMUM-DISTANCE DECODING OF LONG LINEAR C.. (context) - Erdos, Spencer et al. - 1974
Documents on the same site (http://netlib.bell-labs.com/cm/ms/who/abarg/preprints.html): More
Quantum Error Detection I: Statement of the Problem - Ashikhmin, Barg, Knill, Litsyn (2000) (Correct)
Concatenated Codes With Fixed Inner Code, and the Outer.. - Barg, Justesen, al. (Correct)
Quantum Error Detection II: Bounds - Ashikhmin, Barg, Knill, Litsyn (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC