Referenced Items are not available for this document.
A set of binary block codes with incremental redundancy is developed using a combination of a constructive method and a computer search. Generator matrices of thirteen codes with information word lengths of 4 to 16 and with code rates as low as 1/4 or 1/3, respectively, are given. For two codes the minimum distance is compared to the minimum distance of the best known linear block codes with the same parameters. The results indicate that the best minimum distance for a given code length and rate is often achieved by the incremental redundancy codes. Therefore, these codes can provide high throughput in adaptive error control systems over a wide range of channel conditions
Published in:
Information Theory, IEEE Transactions on
(Volume:37
,
Issue:
1
)
Date of Publication: Jan 1991
- Page(s):
- 192 - 195
- ISSN :
- 0018-9448
- INSPEC Accession Number:
- 3847597
- Digital Object Identifier :
- 10.1109/18.61139
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Jan 1991
- Sponsored by :
- IEEE Information Theory Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
