Simple proof that time-invariant convolutional codes attain capacity

Nadav Shulman; Meir Feder

Simple proof that time-invariant convolutional codes attain capacity

Nadav Shulman^*, Meir Feder

^*Corresponding author for this work

School of Electrical Engineering

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

Abstract

It is well known that time-varying convolutional codes can achieve the capacity of a discrete memoryless channel [1]. The time varying assumption is needed in the proof to assure pairwise independency between the codewords. In this work we provide a relatively simple proof that indeed time-invariant convolutional codes can achieve the capacity without any restriction (albeit, the error exponent achieved by our proof may not be the optimal).

Original language	English
Pages	133
Number of pages	1
State	Published - 1995
Event	Proceedings of the 1995 IEEE International Symposium on Information Theory - Whistler, BC, Can Duration: 17 Sep 1995 → 22 Sep 1995

Conference

Conference	Proceedings of the 1995 IEEE International Symposium on Information Theory
City	Whistler, BC, Can
Period	17/09/95 → 22/09/95

Cite this

@conference{c3bba5675759474c961d13aeb9d63b94,

title = "Simple proof that time-invariant convolutional codes attain capacity",

abstract = "It is well known that time-varying convolutional codes can achieve the capacity of a discrete memoryless channel [1]. The time varying assumption is needed in the proof to assure pairwise independency between the codewords. In this work we provide a relatively simple proof that indeed time-invariant convolutional codes can achieve the capacity without any restriction (albeit, the error exponent achieved by our proof may not be the optimal).",

author = "Nadav Shulman and Meir Feder",

year = "1995",

language = "אנגלית",

pages = "133",

note = "null ; Conference date: 17-09-1995 Through 22-09-1995",

}

TY - CONF

T1 - Simple proof that time-invariant convolutional codes attain capacity

AU - Shulman, Nadav

AU - Feder, Meir

PY - 1995

Y1 - 1995

N2 - It is well known that time-varying convolutional codes can achieve the capacity of a discrete memoryless channel [1]. The time varying assumption is needed in the proof to assure pairwise independency between the codewords. In this work we provide a relatively simple proof that indeed time-invariant convolutional codes can achieve the capacity without any restriction (albeit, the error exponent achieved by our proof may not be the optimal).

AB - It is well known that time-varying convolutional codes can achieve the capacity of a discrete memoryless channel [1]. The time varying assumption is needed in the proof to assure pairwise independency between the codewords. In this work we provide a relatively simple proof that indeed time-invariant convolutional codes can achieve the capacity without any restriction (albeit, the error exponent achieved by our proof may not be the optimal).

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

M3 - ???researchoutput.researchoutputtypes.contributiontoconference.paper???

AN - SCOPUS:0029205811

SP - 133

Y2 - 17 September 1995 through 22 September 1995

ER -

Simple proof that time-invariant convolutional codes attain capacity

Abstract

Conference

Other files and links

Fingerprint

Cite this