# Code word

## Papers overview

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

Highly Cited

2013

Highly Cited

2013

- IEEE 24th Annual International Symposium onâ€¦
- 2013

Multicarrier CDMA is a multiplexing approach in which modulated QAM symbols are spread over multiple OFDMA tones by using aâ€¦Â (More)

Is this relevant?

Highly Cited

2010

Highly Cited

2010

- IEEE Transactions on Information Theory
- 2010

We consider a communication system where two transmitters wish to exchange information through a central relay. The transmitterâ€¦Â (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- IEEE Transactions on Wireless Communications
- 2006

Motivated by the recent works on the relay channel and cooperative diversity, this letter introduces coded cooperation, whereâ€¦Â (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- IEEE Trans. Information Theory
- 2001

We introduce a simple erasure recovery algorithm for codes derived from cascades of sparse bipartite graphs and analyze theâ€¦Â (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- IEEE Trans. Information Theory
- 1998

Given an error-correcting code over strings of length n and an arbitrary input string also of length n, the list decoding problemâ€¦Â (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- 1996

This paper deals with a new class of convolutional codes called Turbo-codes, whose performances in terms of Bit Error Rate (BERâ€¦Â (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- IEEE Trans. Information Theory
- 1996

A parallel concatenated coding scheme consists of two simple constituent systematic encoders linked by an interleaver. The inputâ€¦Â (More)

Is this relevant?

Highly Cited

1981

Highly Cited

1981

- IEEE Trans. Information Theory
- 1981

A bstruciA method is described for constructing long error-correcting codes from one or more shorter error-correcting codesâ€¦Â (More)

Is this relevant?

Highly Cited

1976

Highly Cited

1976

- IBM Journal of Research and Development
- 1976

Algorithms for encoding and decoding finite strings over a finite alphabet are described. The coding operations are arithmeticâ€¦Â (More)

Is this relevant?

Highly Cited

1964

Highly Cited

1964

- IEEE Trans. Information Theory
- 1964

t immaru-A q-nary error-correcting code with N = qk code words of length n = k + r can have no greater miniium distance d than râ€¦Â (More)

Is this relevant?