In coding theory, a block code is any member of the large and important family of error-correcting codes that encode data in blocks.There is a vast… (More)

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

Highly Cited

2006

Highly Cited

2006

- Albert Guillén i Fàbregas, Giuseppe Caire
- IEEE Transactions on Information Theory
- 2006

We consider coded modulation schemes for the block-fading channel. In the setting where a codeword spans a finite number N of… (More)

Is this relevant?

2006

2006

- Mathieu Cluzeau
- 2006 IEEE International Symposium on Information…
- 2006

In this paper, we present a new algorithm for recovering a linear block code from noisy codewords. To achieve this, we introduce… (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- Haiquan Wang, Xiang-Gen Xia
- IEEE Trans. Information Theory
- 2003

In this correspondence, we derive some upper bounds of the rates of (generalized) complex orthogonal space–time block codes. We… (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- Sae-Young Chung, G. David Forney, Thomas J. Richardson, Rüdiger L. Urbanke
- IEEE Communications Letters
- 2001

We develop improved algorithms to construct good low-density parity-check codes that approach the Shannon limit very closely. For… (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- Hamid Jafarkhani
- WCNC
- 2000

It has been shown that a complex orthogonal design that provides full diversity and full transmission rate for a space–time block… (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- Vahid Tarokh, Hamid Jafarkhani, A. Robert Calderbank
- IEEE Trans. Information Theory
- 1999

We introduce space–time block coding, a new paradigm for communication over Rayleigh fading channels using multiple transmit… (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- Joachim Hagenauer, Elke Offer, Lutz Papke
- IEEE Trans. Information Theory
- 1996

Iterative decoding of two-dimensional systematic convolutional codes has been termed “turbo” (de)coding. Using log-likelihood… (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- Frank R. Kschischang, Vladislav Sorokine
- IEEE Trans. Information Theory
- 1995

Due to the editorial process, there may be slight discrepancies between this version and the published one. Abstract|The problem… (More)

Is this relevant?

Highly Cited

1978

Highly Cited

1978

- Jack K. Wolf
- IEEE Trans. Information Theory
- 1978

It is shown that soft decision maximum likelihood decoding of any (n,k) linear block code over GF(q) can be accomplished using… (More)

Is this relevant?

Highly Cited

1962

Highly Cited

1962

- Robert G. Gallager
- IRE Trans. Information Theory
- 1962

A low-density parity-check code is a code specified by a parity-check matrix with the following properties : each column contains… (More)

Is this relevant?