Construction of High-Rate Punctured Convolutional Codes through Dual Codes
Summary :
This paper considers a method for constructing good high-rate punctured convolutional codes through dual codes. A low-rate R=1/n convolutional code has a dual code identical to a punctured convolutional code with rate R=(n-1)/n. This implies that a low-rate R=1/n convolutional code encoder can help the search of punctured convolutional code encoders. This paper provides the procedures that obtain all the useful dual code encoders to a given CC with rate R=1/n easily, and the best PCC encoder with rate R=(n-1)/n among the encoders we derive from all the obtained dual code encoders. This paper also shows an example of the PCC the procedures obtain from some CC.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E98-A No.7 pp.1579-1583
- Publication Date
- 2015/07/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E98.A.1579
- Type of Manuscript
- LETTER
- Category
- Coding Theory
Authors
Sen MORIYA
Kinki University
Kana KIKUCHI
Kinki University
Hiroshi SASANO
Kinki University
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
Sen MORIYA, Kana KIKUCHI, Hiroshi SASANO, "Construction of High-Rate Punctured Convolutional Codes through Dual Codes" in IEICE TRANSACTIONS on Fundamentals,
vol. E98-A, no. 7, pp. 1579-1583, July 2015, doi: 10.1587/transfun.E98.A.1579.
Abstract: This paper considers a method for constructing good high-rate punctured convolutional codes through dual codes. A low-rate R=1/n convolutional code has a dual code identical to a punctured convolutional code with rate R=(n-1)/n. This implies that a low-rate R=1/n convolutional code encoder can help the search of punctured convolutional code encoders. This paper provides the procedures that obtain all the useful dual code encoders to a given CC with rate R=1/n easily, and the best PCC encoder with rate R=(n-1)/n among the encoders we derive from all the obtained dual code encoders. This paper also shows an example of the PCC the procedures obtain from some CC.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E98.A.1579/_p
Copy
@ARTICLE{e98-a_7_1579,
author={Sen MORIYA, Kana KIKUCHI, Hiroshi SASANO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Construction of High-Rate Punctured Convolutional Codes through Dual Codes},
year={2015},
volume={E98-A},
number={7},
pages={1579-1583},
abstract={This paper considers a method for constructing good high-rate punctured convolutional codes through dual codes. A low-rate R=1/n convolutional code has a dual code identical to a punctured convolutional code with rate R=(n-1)/n. This implies that a low-rate R=1/n convolutional code encoder can help the search of punctured convolutional code encoders. This paper provides the procedures that obtain all the useful dual code encoders to a given CC with rate R=1/n easily, and the best PCC encoder with rate R=(n-1)/n among the encoders we derive from all the obtained dual code encoders. This paper also shows an example of the PCC the procedures obtain from some CC.},
keywords={},
doi={10.1587/transfun.E98.A.1579},
ISSN={1745-1337},
month={July},}
Copy
TY - JOUR
TI - Construction of High-Rate Punctured Convolutional Codes through Dual Codes
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1579
EP - 1583
AU - Sen MORIYA
AU - Kana KIKUCHI
AU - Hiroshi SASANO
PY - 2015
DO - 10.1587/transfun.E98.A.1579
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E98-A
IS - 7
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - July 2015
AB - This paper considers a method for constructing good high-rate punctured convolutional codes through dual codes. A low-rate R=1/n convolutional code has a dual code identical to a punctured convolutional code with rate R=(n-1)/n. This implies that a low-rate R=1/n convolutional code encoder can help the search of punctured convolutional code encoders. This paper provides the procedures that obtain all the useful dual code encoders to a given CC with rate R=1/n easily, and the best PCC encoder with rate R=(n-1)/n among the encoders we derive from all the obtained dual code encoders. This paper also shows an example of the PCC the procedures obtain from some CC.
ER -
English
