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

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

A new construction for n-track (d, k) codes with redundancy r, referred to as (d, k; n, r) codes, is presented. This construction applies single-track (d, k + Δk) codes (with certain extra constraints and appropriate amounts of delay) on each of the n tracks. This construction achieves a large part of the capacity increases possible when using (d, k; n, r) codes, has simple encoders and decoders, and exhibits considerable robustness to faulty tracks. It is shown that under this construction, (d, k; n, r) codes can achieve at least (n - r - 1)/n × 100% of the gap in capacity between conventional (d, k) and (d, ∞) codes. Several practical examples of (d, k; n, r) codes under this construction are presented.

Original languageEnglish (US)
Pages (from-to)1107-1115
Number of pages9
JournalIEEE Transactions on Information Theory
Volume41
Issue number4
DOIs
StatePublished - Jul 1995

Fingerprint

redundancy
Redundancy

ASJC Scopus subject areas

  • Information Systems
  • Electrical and Electronic Engineering

Cite this

New construction for n-track (d, k) codes with redundancy. / Ke, Ligang; Marcellin, Michael W.

In: IEEE Transactions on Information Theory, Vol. 41, No. 4, 07.1995, p. 1107-1115.

Research output: Contribution to journalArticle

@article{da6e7a74c6d04d6ebf2f470b61840777,
title = "New construction for n-track (d, k) codes with redundancy",
abstract = "A new construction for n-track (d, k) codes with redundancy r, referred to as (d, k; n, r) codes, is presented. This construction applies single-track (d, k + Δk) codes (with certain extra constraints and appropriate amounts of delay) on each of the n tracks. This construction achieves a large part of the capacity increases possible when using (d, k; n, r) codes, has simple encoders and decoders, and exhibits considerable robustness to faulty tracks. It is shown that under this construction, (d, k; n, r) codes can achieve at least (n - r - 1)/n × 100{\%} of the gap in capacity between conventional (d, k) and (d, ∞) codes. Several practical examples of (d, k; n, r) codes under this construction are presented.",
author = "Ligang Ke and Marcellin, {Michael W}",
year = "1995",
month = "7",
doi = "10.1109/18.391253",
language = "English (US)",
volume = "41",
pages = "1107--1115",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "4",

}

TY - JOUR

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

AU - Ke, Ligang

AU - Marcellin, Michael W

PY - 1995/7

Y1 - 1995/7

N2 - A new construction for n-track (d, k) codes with redundancy r, referred to as (d, k; n, r) codes, is presented. This construction applies single-track (d, k + Δk) codes (with certain extra constraints and appropriate amounts of delay) on each of the n tracks. This construction achieves a large part of the capacity increases possible when using (d, k; n, r) codes, has simple encoders and decoders, and exhibits considerable robustness to faulty tracks. It is shown that under this construction, (d, k; n, r) codes can achieve at least (n - r - 1)/n × 100% of the gap in capacity between conventional (d, k) and (d, ∞) codes. Several practical examples of (d, k; n, r) codes under this construction are presented.

AB - A new construction for n-track (d, k) codes with redundancy r, referred to as (d, k; n, r) codes, is presented. This construction applies single-track (d, k + Δk) codes (with certain extra constraints and appropriate amounts of delay) on each of the n tracks. This construction achieves a large part of the capacity increases possible when using (d, k; n, r) codes, has simple encoders and decoders, and exhibits considerable robustness to faulty tracks. It is shown that under this construction, (d, k; n, r) codes can achieve at least (n - r - 1)/n × 100% of the gap in capacity between conventional (d, k) and (d, ∞) codes. Several practical examples of (d, k; n, r) codes under this construction are presented.

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

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

U2 - 10.1109/18.391253

DO - 10.1109/18.391253

M3 - Article

AN - SCOPUS:0029341525

VL - 41

SP - 1107

EP - 1115

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 4

ER -