A Random Coding Bound for Rate k/n Fixed Convolutional Codes
Summary :
In order to guarantee pairwise independence of codewords in an ensemble of convolutional codes it is necessary to consider time-varying codes. However, Seguin has shown that the pairwise independence property is not strictly necessary when applying the random coding argument and on this basis he derives a new random coding bound for rate 1/n fixed convolutional codes. In this paper we show that a similar random coding bound can be obtained for rate k/n fixed convolutional codes.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E82-A No.10 pp.2017-2021
- Publication Date
- 1999/10/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section on Information Theory and Its Applications)
- Category
- Coding Theory
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Conor O'DONOGHUE, Cyril J. BURKLEY, "A Random Coding Bound for Rate k/n Fixed Convolutional Codes" in IEICE TRANSACTIONS on Fundamentals,
vol. E82-A, no. 10, pp. 2017-2021, October 1999, doi: .
Abstract: In order to guarantee pairwise independence of codewords in an ensemble of convolutional codes it is necessary to consider time-varying codes. However, Seguin has shown that the pairwise independence property is not strictly necessary when applying the random coding argument and on this basis he derives a new random coding bound for rate 1/n fixed convolutional codes. In this paper we show that a similar random coding bound can be obtained for rate k/n fixed convolutional codes.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e82-a_10_2017/_p
Copy
@ARTICLE{e82-a_10_2017,
author={Conor O'DONOGHUE, Cyril J. BURKLEY, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Random Coding Bound for Rate k/n Fixed Convolutional Codes},
year={1999},
volume={E82-A},
number={10},
pages={2017-2021},
abstract={In order to guarantee pairwise independence of codewords in an ensemble of convolutional codes it is necessary to consider time-varying codes. However, Seguin has shown that the pairwise independence property is not strictly necessary when applying the random coding argument and on this basis he derives a new random coding bound for rate 1/n fixed convolutional codes. In this paper we show that a similar random coding bound can be obtained for rate k/n fixed convolutional codes.},
keywords={},
doi={},
ISSN={},
month={October},}
Copy
TY - JOUR
TI - A Random Coding Bound for Rate k/n Fixed Convolutional Codes
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2017
EP - 2021
AU - Conor O'DONOGHUE
AU - Cyril J. BURKLEY
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E82-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 1999
AB - In order to guarantee pairwise independence of codewords in an ensemble of convolutional codes it is necessary to consider time-varying codes. However, Seguin has shown that the pairwise independence property is not strictly necessary when applying the random coding argument and on this basis he derives a new random coding bound for rate 1/n fixed convolutional codes. In this paper we show that a similar random coding bound can be obtained for rate k/n fixed convolutional codes.
ER -
English
