Tom Høholdt

Fernando Piñero

Peng Zeng

Des. Codes Cryptogr., 2015

Linear complexity for multidimensional arrays - a numerical invariant.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

2014

On the sizes of expander graphs and minimum distances of graph codes.

[BibT_eX]

[DOI]

Discret. Math., 2014

2013

On Rational Interpolation-Based List-Decoding and List-Decoding Binary Goppa Codes.

[BibT_eX]

[DOI]

Johan Sebastian Rosenkilde Nielsen

Yingquan Wu

IEEE Trans. Inf. Theory, 2013

On the dimension of graph codes with Reed-Solomon component codes.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012

Duals of Affine Grassmann Codes and Their Relatives.

[BibT_eX]

[DOI]

Sudhir R. Ghorpade

IEEE Trans. Inf. Theory, 2012

Eigenvalues and expansion of bipartite graphs.

[BibT_eX]

[DOI]

Heeralal Janwa

Des. Codes Cryptogr., 2012

List decoding of matrix-product codes from nested codes: An application to quasi-cyclic codes.

[BibT_eX]

[DOI]

Fernando Hernando

Diego Ruano

Adv. Math. Commun., 2012

2011

The Minimum Distance of Graph Codes.

[BibT_eX]

[DOI]

Proceedings of the Coding and Cryptology - Third International Workshop, 2011

2010

Affine Grassmann codes.

[BibT_eX]

[DOI]

Sudhir R. Ghorpade

IEEE Trans. Inf. Theory, 2010

2009

Optimal Bipartite Ramanujan Graphs from Balanced Incomplete Block Designs: Their Characterizations and Applications to Expander/LDPC Codes.

[BibT_eX]

[DOI]

Heeralal Janwa

Proceedings of the Applied Algebra, 2009

2008

Codes from Expander Graphs.

[BibT_eX]

[DOI]

Proceedings of the Coding Theory and Applications, Second International Castle Meeting, 2008

A Syndrome Formulation of the Interpolation Step in the Guruswami-Sudan Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Coding Theory and Applications, Second International Castle Meeting, 2008

2007

Iterative List Decoding of Some LDPC Codes.

[BibT_eX]

[DOI]

Johann Hjaltason

IEEE Trans. Inf. Theory, 2007

Iterative List Decoding of LDPC Codes.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 2007

2006

Graph Codes with Reed-Solomon Component Codes.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

The Merit Factor Problem for Binary Sequences.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 2006

2005

Iterative list decoding.

[BibT_eX]

[DOI]

Johann Hjaltason

Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, 2005

Euclidean geometry codes, minimum weight words and decodable error-patterns using bit-flipping.

[BibT_eX]

[DOI]

Bergtor Jonsson

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004

From concatenated codes to graph codes.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE Information Theory Workshop, 2004

Decoding of concatenated codes with interleaved outer codes.

[BibT_eX]

[DOI]

Christian Thommesen

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

A Course In Error-Correcting Codes.

[BibT_eX]

[DOI]

EMS textbooks in mathematics, European Mathematical Society, ISBN: 978-3-03719-001-2, 2004

2001

Bounds on list decoding of MDS codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2001

On Hyperbolic Codes.

[BibT_eX]

[DOI]

Olav Geil

Proceedings of the Applied Algebra, 2001

2000

Footprints or generalized Bezout's theorem.

[BibT_eX]

[DOI]

Olav Geil

IEEE Trans. Inf. Theory, 2000

1999

Performance analysis of a decoding algorithm for algebraic-geometry codes.

[BibT_eX]

[DOI]

Rasmus Refslund Nielsen

IEEE Trans. Inf. Theory, 1999

Decoding Hermitian Codes with Sudan's Algorithm.

[BibT_eX]

[DOI]

Rasmus Refslund Nielsen

Proceedings of the Applied Algebra, 1999

1998

Fast Erasure-and-Error Decoding of Algebraic Geometry Codes up to the Feng-Rao Bound.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1998

Algebraic-Geometry Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1998

1997

An explicit construction of a sequence of codes attaining the Tsfasman-Vladut-Zink bound: The first steps.

[BibT_eX]

[DOI]

Conny Voss

IEEE Trans. Inf. Theory, 1997

Order Functions and Evaluation Codes.

[BibT_eX]

[DOI]

Jacobus H. van Lint

Ruud Pellikaan

Proceedings of the Applied Algebra, 1997

1995

Fast decoding of algebraic-geometric codes up to the designed minimum distance.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1995

Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound.

[BibT_eX]

[DOI]

Shojiro Sakata

IEEE Trans. Inf. Theory, 1995

On the decoding of algebraic-geometric codes.

[BibT_eX]

[DOI]

Ruud Pellikaan

IEEE Trans. Inf. Theory, 1995

1993

On the number of correctable errors for some AG-codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1993

1992

Fast decoding of codes from algebraic plane curves.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1992

1991

The merit factor of binary sequences related to difference sets.

[BibT_eX]

[DOI]

Jørn M. Jensen

IEEE Trans. Inf. Theory, 1991

1989

Construction and decoding of a class of algebraic geometry codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1989

1988

Double series representation of bounded signals.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1988

Determination of the merit factor of Legendre sequences.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1988

1987

Binary Sequences with Good Correlation Properties.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 1987

1986

Autocorrelation properties of a class of infinite binary sequences.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1986

1985

Aperiodic correlations and the merit factor of a class of binary sequences.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1985

1984

Maxentropic Markov chains.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1984

1983

Ternary sequences with perfect periodic autocorrelation.

[BibT_eX]

[DOI]