New construction for n-track (d,k) codes with redundancy

Ligang Ke; Michael W. Marcellin

New construction for n-track (d,k) codes with redundancy

Research output: Contribution to conference › Paper › peer-review

Abstract

This paper proposes a new method that is used to construct (d, k; n, r) codes. The method uses a single (d, k + Δk) code on each of the n tracks. Thus, these codes fall in the category of the (d_x, k_x, ky:n) codes. With this new method, increased capacity as well as increase in robustness are obtained. Finally, an example is provided to demonstrate the efficiency of the proposed method.

Original language	English (US)
State	Published - 1994
Event	Proceedings of the 1994 IEEE International Symposium on Information Theory - Trodheim, Norw Duration: Jun 27 1994 → Jul 1 1994

Other

Other	Proceedings of the 1994 IEEE International Symposium on Information Theory
City	Trodheim, Norw
Period	6/27/94 → 7/1/94

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Cite this

@conference{92200db627ea4c188b65e455df12d72e,

title = "New construction for n-track (d,k) codes with redundancy",

abstract = "This paper proposes a new method that is used to construct (d, k; n, r) codes. The method uses a single (d, k + Δk) code on each of the n tracks. Thus, these codes fall in the category of the (dx, kx, ky:n) codes. With this new method, increased capacity as well as increase in robustness are obtained. Finally, an example is provided to demonstrate the efficiency of the proposed method.",

author = "Ligang Ke and Marcellin, {Michael W.}",

year = "1994",

language = "English (US)",

note = "Proceedings of the 1994 IEEE International Symposium on Information Theory ; Conference date: 27-06-1994 Through 01-07-1994",

}

TY - CONF

T1 - New construction for n-track (d,k) codes with redundancy

AU - Ke, Ligang

AU - Marcellin, Michael W.

PY - 1994

Y1 - 1994

N2 - This paper proposes a new method that is used to construct (d, k; n, r) codes. The method uses a single (d, k + Δk) code on each of the n tracks. Thus, these codes fall in the category of the (dx, kx, ky:n) codes. With this new method, increased capacity as well as increase in robustness are obtained. Finally, an example is provided to demonstrate the efficiency of the proposed method.

AB - This paper proposes a new method that is used to construct (d, k; n, r) codes. The method uses a single (d, k + Δk) code on each of the n tracks. Thus, these codes fall in the category of the (dx, kx, ky:n) codes. With this new method, increased capacity as well as increase in robustness are obtained. Finally, an example is provided to demonstrate the efficiency of the proposed method.

UR - http://www.scopus.com/inward/record.url?scp=0028698305&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0028698305&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0028698305

T2 - Proceedings of the 1994 IEEE International Symposium on Information Theory

Y2 - 27 June 1994 through 1 July 1994

ER -

New construction for n-track (d,k) codes with redundancy

Abstract

Other

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this