Some periodic time-varying convolutional codes with free distance achieving the heller bound

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

Some periodic time-varying convolutional codes with free distance greater than the best known time-invariant code of the same rate and total encoder memory are presented. These codes also achieve the Heller bound for the given code parameters.

Original languageEnglish (US)
Number of pages1
JournalIEEE International Symposium on Information Theory - Proceedings
DOIs
StatePublished - Jan 1 2001

Fingerprint

Convolutional Codes
Convolutional codes
Time-varying
Data storage equipment
Encoder
Invariant

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Cite this

@article{5640923ae9a94d318753459d579999c7,
title = "Some periodic time-varying convolutional codes with free distance achieving the heller bound",
abstract = "Some periodic time-varying convolutional codes with free distance greater than the best known time-invariant code of the same rate and total encoder memory are presented. These codes also achieve the Heller bound for the given code parameters.",
author = "Q. Hu and Perez, {Lance C}",
year = "2001",
month = "1",
day = "1",
doi = "10.1109/ISIT.2001.936110",
language = "English (US)",
journal = "IEEE International Symposium on Information Theory - Proceedings",
issn = "2157-8097",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Some periodic time-varying convolutional codes with free distance achieving the heller bound

AU - Hu, Q.

AU - Perez, Lance C

PY - 2001/1/1

Y1 - 2001/1/1

N2 - Some periodic time-varying convolutional codes with free distance greater than the best known time-invariant code of the same rate and total encoder memory are presented. These codes also achieve the Heller bound for the given code parameters.

AB - Some periodic time-varying convolutional codes with free distance greater than the best known time-invariant code of the same rate and total encoder memory are presented. These codes also achieve the Heller bound for the given code parameters.

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

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

U2 - 10.1109/ISIT.2001.936110

DO - 10.1109/ISIT.2001.936110

M3 - Article

JO - IEEE International Symposium on Information Theory - Proceedings

JF - IEEE International Symposium on Information Theory - Proceedings

SN - 2157-8097

ER -