Skip to search formSkip to main contentSemantic Scholar

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2012

2012

Let <i>A</i>(<i>n</i>,<i>d</i>) be the maximum number of 0, 1 words of length <i>n</i> , any two having Hamming distance at least… Expand

Is this relevant?

Highly Cited

2007

Highly Cited

2007

For a linear block code with minimum distance d, its stopping redundancy is the minimum number of check nodes in a Tanner graph… Expand

Is this relevant?

2002

2002

We describe a method for transforming a generalized parity check (GPC) matrix representation of a block linear binary code into… Expand

Is this relevant?

Highly Cited

1995

Highly Cited

1995

This paper presents some basic theorems giving the structure of cyclic codes of lengthn over the ring of integers modulopa and… Expand

Is this relevant?

Highly Cited

1994

Highly Cited

1994

Certain notorious nonlinear binary codes contain more codewords than any known linear code. These include the codes constructed… Expand

Is this relevant?

Highly Cited

1994

Highly Cited

1994

In this paper we exploit the relations between near polygons with lines of size 3 and Fischer spaces to classify near hexagons… Expand

Is this relevant?

Highly Cited

1993

Highly Cited

1993

The Nordstrom-Robinson, Kerdock, and (slightly modified) Preparata codes are shown to be linear over Z4 , the integers mod 4… Expand

Is this relevant?

1993

1993

A decoding algorithm is presented for the ternary (11, 6, 5) Golay code. This algorithm is an algebraic decoding and relies on… Expand

Is this relevant?

1990

1990

Abstract In this note we answer the following question in the affirmative: Is there a natural algebraic structure on the vector… Expand

Is this relevant?

1986

1986

Description du code [12,6,6] de Golay ternaire etendu comme l'image d'un code sur le corps de 9 elements. Structure des poids du… Expand

Is this relevant?