Complexity Issues in Coding Theory

Complexity Issues in Coding Theory (1997)

by Alexander Barg

Citations:

14 - 1 self

@MISC{Barg97complexityissues,
    author = {Alexander Barg},
    title = {Complexity Issues in Coding Theory},
    year = {1997}
}

This paper gives concatenated codes with uniform construction complexity of order n

2172	The design and analysis of computer algorithms - Aho, Hopcroft, et al. - 1974
1478	The probabilistic method - Spencer - 1992
220	Priority encoding transmission - Albanese, Blomer, et al. - 1994
137	The hardness of approximate optima in lattices, codes, and systems of linear equations - Arora, Babai, et al. - 1993
102	Constructions of asymptotically good low-rate error-correcting codes through pseudo-random graphs - Alon, Bruck, et al. - 1992
89	Explicit construction of linear sized tolerant networks - Alon, Chung - 1988
65	Probabilistic Checking of Proofs and Hardness of Approximation Problems - Arora - 1994
12	Voronoi regions for binary linear block codes - Agrell - 1996
6	codes, PCPs, and inapproximability - Reductions - 1995
5	Pooling, splitting and restituting information to overcome total failure of some channels of communication - Asmuth, Blakley - 1982
4	Description of minimum weight codewords of cyclic codes by algebraic systems - Augot - 1996
4	Complexity and sliding-block decodability - Ashley, Karabed, et al. - 1996
3	A linear time erasure resilient code with nearly optimal recovery - Alon, Luby - 1996
3	Minimal vectors in linear codes and sharing of secrets - Ashikhmin, Barg - 1994
2	Asymptotically optimal binary codes of polynomial complexity correcting localized errors - Ahlswede, Bassalygo, et al. - 1995
2	Variations on minimal codewords in linear codes - Ashikhmin, Barg, et al. - 1995