Alexander Barg  Home/Search
Context Related
Links: DBLP | unipaderborn.de/f...odingTheory.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: unipaderborn.de/fachbe...scripts (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper gives concatenated codes with uniform construction complexity of order n (Update)
Context of citations to this paper: More
.... hard e.g. approximation [2, 20] to within error bounded by distance [23] xed number of errors [21] See also the survey by Barg [5]. In this section we will not deal with such problems, but focus on this problem for xed classes of (algebraic) codes. Even after we x the...
...such that any vector x X n has a relatively light subvector xz on some decomposition Z Z . Lemma 11 is discussed in detail in [6] and [4], where the set ( is written out explicitly. Here we omit the lengthy proof. Instead, we consider two examples that illuminate general...
Cited by: More
A Fast Provably Secure Cryptographic Hash Function - Augot, Finiasz, Sendrier (2003) (Correct)
On the Groebner bases of some symmetric systems and their.. - Mora, Sala (2003) (Correct)
Error Exponents of Expander Codes Under Linear-Complexity Decoding - Barg (2002) (Correct)
Active bibliography (related documents): More All
6.3: On the Complexity of Minimum Distance Decoding of Long.. - Barg, Krouk, van Tilborg (1999) (Correct)
1.4: Minimal Vectors in Linear Codes - Ashikhmin, Barg (Correct)
1.1: Linear-Time Binary Codes Correcting Localized Erasures - Alexander Barg (1997) (Correct)
Similar documents based on text: More All
0.2: Fast Local Covers - Iliopoulos, Mouchard (1998) (Correct)
0.1: A Normalform for Classes of Concatenation Hierarchies - Glaßer (1998) (Correct)
0.1: Learning Concatenations of Locally Testable Languages from.. - Kobayashi, Yokomori (1994) (Correct)
Related documents from co-citation: More All
4: The Theory of Error-Correcting Codes (context) - MacWilliams, Sloane - 1977
4: Low-density parity-check codes (context) - Gallager - 1962
3: A class of constructive asymptotically good algebraic codes (context) - Justesen - 1972
BibTeX entry: (Update)
A. Barg, "Complexity issues in coding theory," in V. Pless and W. Cary Huffman, Eds., Handbook of Coding Theory, Elsevier Science, to be published. http://citeseer.ist.psu.edu/barg97complexity.html More
@article{ barg97complexity,
author = "Alexander Barg",
title = "Complexity Issues in Coding Theory",
journal = "Electronic Colloquium on Computational Complexity (ECCC)",
volume = "4",
number = "046",
year = "1997",
url = "citeseer.ist.psu.edu/barg97complexity.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1978
3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
2003 The Art of Computer Programming (context) - Knuth - 1973
951 Computational Complexity (context) - Papadimitriou - 1995 ACM
442 Optimal decoding of linear codes for minimizing symbol error.. (context) - Bahl, Cocke et al. - 1974
341 Low-Density Parity-Check Codes (context) - Gallager - 1963
229 Theory of Recursive Functions and Effective Computability (context) - Rogers - 1967 ACM
164 Polynomial-time algorithm for prime factorization and discre.. - Shor - 1994
158 Matroid Theory (context) - Welsh - 1977
148 Ramanujan graphs (context) - Lubotzky, Phillips et al. - 1988 DBLP
113 Reliable broadband communication using a burst erasure corre.. - McAuley - 1990
112 Average case complete problems (context) - Levin - 1986 ACM DBLP
109 Practical loss-resilient codes - Luby, Mitzenmacher et al. - 1997 ACM DBLP
90 Spectral Graph Theory (context) - Chung - 1997
88 A recursive approach to low complexity codes (context) - Tanner - 1981
73 the inherent intractability of certain coding problems (context) - Berlekamp, McEliece et al. - 1978
63 A public-key cryptosystem based on algebraic coding theory (context) - McEliece - 1978
60 Efficient dispersal of information for security, load balanc.. (context) - Rabin - 1989 ACM DBLP
59 IEEE Trans (context) - the, of et al. - 1992
58 Construction of asymptotically good low-rate error-correctin.. (context) - Alon, Bruck et al. - 1992
57 Probabilistic Methods in Combinatorics - Erdos, Spencer - 1974
54 Explicit constructions of concentrators (context) - Margulis - 1973
52 Good quantum error-correcting codes exist - Calderbank, Shor - 1996
35 Explicit constructions of linear sized tolerant networks (context) - Alon, Chung - 1988
32 Machine models and simulations (context) - Boas - 1990
30 Ullman The Design and Analysis of Computer Algorithms (context) - Aho, Hoprcroft - 1974
28 A class of constructive, asymptotically good algebraic codes (context) - Justesen - 1972
28 Computational Complexity (context) - Wagner, Wechsung - 1986 ACM
28 A polynomial-time algorithm to find the shortest cycle basis.. (context) - Horton - 1987 ACM DBLP
26 Generalized minimum distance decoding (context) - Forney - 1966
24 Algebraic-Geometric Codes (context) - Tsfasman, Vladut - 1991
24 Efficient maximum likelihood decoding of linear codes using .. (context) - Wolf - 1978
24 Computational and Algorithmic Problems in Finite Fields (context) - Shparlinski - 1992
20 New York (context) - Theory, Communication - 1968
18 The intractability of computing the minimum distance of a co.. (context) - Vardy - 1997
17 Transparent proofs and limits to approximation - Babai - 1994 ACM
17 Theory of codes with maximum rank distance (context) - Gabidulin - 1985
17 A Course in Mathematical Logic (context) - Manin - 1976
16 The hardness of decoding linear codes with preprocessing (context) - Bruck, Naor - 1990
15 Finite Fields: Structure and Arithmetics (context) - Jungnickel - 1992
14 Handbook of Theoretical Computer Science (context) - of, classes et al. - 1990 ACM
13 Conservative weightings and ear-decompositions of graphs (context) - Frank - 1993 ACM DBLP
13 A Justesen construction of binary concatenated codes which a.. (context) - Shen - 1993
12 On covering problems of codes (context) - Frances, Litman - 1997 DBLP
11 New constructions for covering designs (context) - Gordon, Patashnik et al. - 1995
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 On finding a cycle basis with a shortest maximal cycle (context) - Chickering, Geiger et al. - 1995 ACM DBLP
9 The use of coding theory in computational complexity - Feigenbaum - 1995
8 Coding for memory with defective cells (context) - Kuznetsov, Tsybakov - 1974
8 An estimate of complexity of constructing binary linear casc.. (context) - Zyablov - 1971
7 Decoding the Golay codes (context) - Pless - 1986
7 Voronoi regions for binary linear block codes (context) - Agrell - 1996
7 The Hamming-sphere has minimum boundary (context) - Katona - 1975
7 An explicit construction of a sequence of codes attaining th.. - Voss, Hoholdt - 1997
7 Minimal permutation sets for decoding the binary Golay code (context) - Gordon - 1982
7 Graph-theoretic error-correcting codes (context) - Hakimi, Bredeson - 1968
6 Efficient priority first search maximum-likelihood soft deci.. (context) - Han, Hartmann et al. - 1993
6 Weight spectrum of the binary Bose--Chaudhuri--Hocquenghem c.. (context) - Sidelnikov - 1971
6 More efficient soft decoding of the Golay codes (context) - Vardy, Be'ery - 1991
6 the Complexity of Coding (context) - Gelfand, Dobrushin et al. - 1973
5 IEEE Trans (context) - decoding, block - 1980
5 Complexity and sliding-block decodability (context) - Ashley, Karabed et al. - 1996
5 Computing automorphism groups of error-correcting codes (context) - Leon - 1982
5 Spectral techniques for expander codes - Lafferty, Rockmore - 1997 ACM DBLP
5 Testing and weight distributions of dual codes - Kiwi DBLP
5 Superimposed concatenated codes (context) - Sugiyama, Kasahara et al. - 1980
4 the complexity of some coding problems (context) - Ntafos, Hakimi - 1981
4 The complexity of computing the covering radius of a code (context) - McLoughlin - 1984
4 Some new NP-complete coding problems (context) - Barg - 1994
4 On decoding by error location and dependent sets of error po.. (context) - Pellikaan - 1992 ACM
4 Asymptotically optimal covering designs (context) - Gordon, Kuperberg et al. - 1996 ACM
4 Algorithms: Main Ideas and Applications (context) - Uspensky, Semenov - 1993 ACM
3 Code design (context) - Honkala, Ostergard - 1997
3 Matchings and coverings in hypergraphs (context) - Furedi - 1988
3 Lower asymptotic bound on the number of linear code words in.. (context) - Blinovskii - 1987
3 Bounded distance + 1 soft decision Reed--Solomon decoding (context) - Berlekamp - 1996
3 Asymptotically good codes correcting insertions, deletions, .. (context) - Shulman, Zuckerman - 1997 ACM
3 A new approach to the general minimum distance decoding prob.. (context) - Levitin, Hartmann - 1985
3 Is code equivalence easy to decide - Petrank, Roth - 1997
3 Average case complete problems (context) - Gurevich - 1991 ACM DBLP
3 Minimal vectors in linear codes and sharing of secrets - Ashikhmin, Barg - 1994
3 Complexity of decoding for linear codes (context) - Evseev - 1983
3 On generator matrices of codes (context) - Simonis - 1992
3 A new Reed--Solomon code decoding algorithm based on Newton'.. (context) - Sorger - 1993
3 Fast generalized minimum distance decoding of algebraic-geom.. (context) - Kotter - 1996
3 The Radon transform on Z k 2 (context) - Diaconis, Graham - 1985
3 Computationally efficient soft-decision decoding of linear b.. (context) - Fossorier, Lin - 1996
3 The weight distribution of extended binary primitive BCH cod.. (context) - Desaki, Fujiwara et al. - 1997
2 Asymptotically optimal binary codes of polynomial complexity.. (context) - Ahlswede, Bassalygo et al. - 1995
2 Estimation of the error-correcting complexity of Gallager lo.. (context) - Zyablov, Pinsker - 1975
2 Bounds to the trellis decoding complexity of linear block co.. (context) - Zyablov, Sidorenko - 1993
2 The hardness of approximating optima in lattices, codes, and.. (context) - Arora, Babai et al. - 1993
2 Linear complexity in coding theory (context) - Massey, Schaub - 1988 ACM DBLP
2 Decoding algorithms of error-correcting codes by use of anal.. (context) - Miyakawa, Kaneko - 1975
2 The use of information sets in decoding cyclic codes (context) - Prange - 1962
2 Pooling, splitting and restituting information to overcome t.. (context) - Asmuth, Blakley - 1982
2 Variations on minimal codewords in linear codes - Ashikhmin, Barg et al. - 1995 ACM DBLP
2 the basic averaging arguments for linear codes (context) - Loeliger - 1994
2 Concatenated decoding algorithm with incomplete inspection o.. (context) - Barg, Dumer - 1986
2 Codes for channels with localized errors (context) - Bassalygo, Gelfand et al. - 1989
2 Decoding complexity bound for linear block codes (context) - Krouk - 1989
2 Decoding by generalized information sets (context) - Krouk, Fedorenko - 1995
2 IEEE Trans (context) - algorithm, minimum et al. - 1988
2 Location-correcting codes - Roth, Seroussi - 1996
2 Problems of Info (context) - uniform, spectra et al. - 1990
2 Limit probabilities for coranks of matrices over GF (q (context) - Gerth - 1986
2 New approaches to reduced complexity decoding (context) - Coffey, Goodman et al. - 1991
2 the McEliece public-key cryptosystem (context) - van Tilburg - 1990
2 Approximating the number of error locations within a constan.. (context) - Stern - 1993
2 with applications to coding theory (context) - over, field - 1978
2 Two decoding algorithms for linear codes (context) - Dumer - 1989
2 an and R. A. Games, "(n; k; t)-covering systems and error-tr.. (context) - Ch - 1981
2 Problems of Info (context) - linear, defects et al. - 1990
2 Error-locating pairs for cyclic codes - Duursma, Kotter - 1994
2 The complexity of information set decoding (context) - Coffey, Goodman - 1990
1 Maximal-rank array codes and their application to crisscross.. (context) - Roth - 1991
1 on Foundations of Computer Science (context) - codes, inapproximability et al. - 1995
1 Problems of Info (context) - low-density - 1991
1 New York: Wiley-Interscience Publications (context) - Savage, of - 1976
1 Finding the permutation between equivalent binary codes (context) - Sendrier - 1997
1 Chichester: Wiley-Interscience (context) - Alon, Spencer et al. - 1992
1 Random methods in design theory: A survey (context) - Grable, Phelps - 1995
1 Problems of Info (context) - decoding - 1981
1 A permutation decoding of the (24; 12; 8) Golay code (context) - Wolfmann - 1983
1 Problems of complexity in the theory of error-correcting cod.. (context) - Bassalygo, Zyablov et al. - 1977
1 Algebraic decoding of the (23; 12; 7) Golay code (context) - Elia - 1987
1 also Proc (context) - decoding, presorting - 1997
1 Simple combinatorial decoding of the [23,12,7] Golay code (context) - Blaum, Bruck - 1990
1 th Joint SovietSwedish Int (context) - distance, linear et al. - 1991
1 Regular codes in regular graphs are difficult (context) - Kratochvil - 1994 ACM
1 Kluwer: Boston (context) - Coding - 1997
1 Distance distributions of functions over Hamming spaces (context) - Delsarte - 1975
1 A note on rank and nullity in coding theory (context) - Calabi - 1961 DBLP
1 Plane Models of Drinfeld Modular Curves (context) - Jim'enez - 1996
1 The Nordstrom-Robinson code: representation over GF(4) and e.. (context) - Vardy - 1994
1 Decoding of Reed--Solomon codes beyond (context) - Reed, beyond et al. - 1994
1 Two classes of generalized minimum distance decoding algorit.. (context) - Kovalev - 1986
1 Proc. 4th Intern. Workshop (context) - algebra, coding - 1994
1 Partial ordering of error patterns for maximum likelihood so.. (context) - Snyders - 1992 ACM DBLP
1 Block codes from convolutional codes (context) - Kudryashov, Zakharova - 1989
1 A decoding procedure for multiple-error-correcting cyclic co.. (context) - Kasami - 1964
1 New York: Springer (context) - for, of et al. - 1989
1 Coding decreases delay of messages (context) - Kabatianski, Krouk - 1993
1 Problems of Info (context) - constructions, schemes et al. - 1988
1 A new algorithm for finding minimum-weight codewords in a li.. (context) - Canteaut, Chabaud - 1995
1 Reliability-based code-search algorithms for maximum-likelih.. (context) - Gazelle, Snyders - 1997 DBLP
1 Tools for coset weight enumerators of some codes (context) - Charpin - 1994
1 Complexity of asymptotically optimal code realization by con.. (context) - Gelfand, Dobrushin - 1972
1 Linear-time binary codes correcting localized erasures - Barg, Zhou - 1997
1 Decoding algorithms of linear block codes (context) - Fedorenko - 1993
1 Description of minimum weight codewords of cyclic codes by a.. - Augot - 1996
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.uni-paderborn.de/fachbereich/AG/agmadh/WWW/english/scripts.html): More
Coding and Cryptography - Körner (1998) (Correct)
Advanced Algorithms - Network flows - Goemans (1994) (Correct)
Applicative Programming and Specification - Gilmore (1993) (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