# Linear code

## Papers overview

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

Highly Cited

2014

Highly Cited

2014

- IEEE Journal on Selected Areas in Communications
- 2014

Linear erasure codes with local repairability are desirable for distributed data storage systems. An [n, k, d] linear code havingâ€¦Â (More)

Is this relevant?

Highly Cited

2010

Highly Cited

2010

- IEEE Computer Society Conference on Computerâ€¦
- 2010

The traditional SPM approach based on bag-of-features (BoF) requires nonlinear classifiers to achieve good image classificationâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- IEEE Transactions on Information Theory
- 2005

A new method is given for performing approximate maximum-likelihood (ML) decoding of an arbitrary binary linear code based onâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- IEEE Transactions on Information Theory
- 2005

It is known that every solvable multicast network has a scalar linear solution over a sufficiently large finite-field alphabetâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- IEEE Trans. Information Theory
- 2003

Consider a communication network in which certain source nodes multicast information to other nodes on the network in theâ€¦Â (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- IEEE Trans. Communications
- 1998

This paper describes an iterative decoding algorithm for any product code built using linear block codes. It is based on softâ€¦Â (More)

Is this relevant?

Highly Cited

1994

Highly Cited

1994

- IEEE Trans. Information Theory
- 1994

Certain notorious nonlinear binary codes contain more codewords than any known linear code. These include the codes constructedâ€¦Â (More)

Is this relevant?

Highly Cited

1992

Highly Cited

1992

- Discrete Mathematics
- 1992

A linear code with a complementary dual (or an LCD code) is defined to be a linear code C whose dual code CâŠ¥ satisfies C âˆ© Câ€¦Â (More)

Is this relevant?

Highly Cited

1982

Highly Cited

1982

- IEEE Trans. Information Theory
- 1982

A/~~stract-For Slepian-Wolf source networks, the error exponents obtained by Kiirner, Marton, and the author are shown to beâ€¦Â (More)

Is this relevant?

Highly Cited

1978

Highly Cited

1978

- 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?