A New Class of Orchard Codes with Double Bit Error and Single Byte Error Correcting Capability

Akira SHIOZAKI

A New Class of Orchard Codes with Double Bit Error and Single Byte Error Correcting Capability

Akira SHIOZAKI

Full Text Views

0

Share
Cite this

Summary :

Orchard coding scheme is a kind of convolutional coding system of rate (n₀1)/n₀. In this system. Calculation of parity bits is over perviously calculated parity bits as well as information bits. This article presents a new class of orchard codes which correct double bit errors and single byte errors within a constraint length. The rate of the codes is (n₀1)/n₀ and the constraint length is n₀(4n₀+1) bits. A byte is group of n₀ bits. In the proposed codes, the generation of a present parity bit is affected by the information bits and the parity bits for past 2n₀ clock times. The decoder generates a syndrome sequence and errors are corrected using the syndrome pattern. An error propagation occurs only when the punctuation of a syndrome pattern of length 4n₀+1 is erroneous, but if the successive 4n₀ zero-bits appear in the syndrome sequence, the error propagation does not occur beyond that.

Publication: IEICE TRANSACTIONS on transactions Vol.E69-E No.12 pp.1330-1333

Publication Date: 1986/12/25

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Source Encoding and Communication Terminals

Authors

Akira SHIOZAKI

Keyword

Cite this

Copy

Akira SHIOZAKI, "A New Class of Orchard Codes with Double Bit Error and Single Byte Error Correcting Capability" in IEICE TRANSACTIONS on transactions, vol. E69-E, no. 12, pp. 1330-1333, December 1986, doi: .
Abstract: Orchard coding scheme is a kind of convolutional coding system of rate (n₀1)/n₀. In this system. Calculation of parity bits is over perviously calculated parity bits as well as information bits. This article presents a new class of orchard codes which correct double bit errors and single byte errors within a constraint length. The rate of the codes is (n₀1)/n₀ and the constraint length is n₀(4n₀+1) bits. A byte is group of n₀ bits. In the proposed codes, the generation of a present parity bit is affected by the information bits and the parity bits for past 2n₀ clock times. The decoder generates a syndrome sequence and errors are corrected using the syndrome pattern. An error propagation occurs only when the punctuation of a syndrome pattern of length 4n₀+1 is erroneous, but if the successive 4n₀ zero-bits appear in the syndrome sequence, the error propagation does not occur beyond that.
URL: https://globals.ieice.org/en_transactions/transactions/10.1587/e69-e_12_1330/_p

Copy

@ARTICLE{e69-e_12_1330,
author={Akira SHIOZAKI, },
journal={IEICE TRANSACTIONS on transactions},
title={A New Class of Orchard Codes with Double Bit Error and Single Byte Error Correcting Capability},
year={1986},
volume={E69-E},
number={12},
pages={1330-1333},
abstract={Orchard coding scheme is a kind of convolutional coding system of rate (n₀1)/n₀. In this system. Calculation of parity bits is over perviously calculated parity bits as well as information bits. This article presents a new class of orchard codes which correct double bit errors and single byte errors within a constraint length. The rate of the codes is (n₀1)/n₀ and the constraint length is n₀(4n₀+1) bits. A byte is group of n₀ bits. In the proposed codes, the generation of a present parity bit is affected by the information bits and the parity bits for past 2n₀ clock times. The decoder generates a syndrome sequence and errors are corrected using the syndrome pattern. An error propagation occurs only when the punctuation of a syndrome pattern of length 4n₀+1 is erroneous, but if the successive 4n₀ zero-bits appear in the syndrome sequence, the error propagation does not occur beyond that.},
keywords={},
doi={},
ISSN={},
month={December},}

Copy

TY - JOUR
TI - A New Class of Orchard Codes with Double Bit Error and Single Byte Error Correcting Capability
T2 - IEICE TRANSACTIONS on transactions
SP - 1330
EP - 1333
AU - Akira SHIOZAKI
PY - 1986
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E69-E
IS - 12
JA - IEICE TRANSACTIONS on transactions
Y1 - December 1986
AB - Orchard coding scheme is a kind of convolutional coding system of rate (n₀1)/n₀. In this system. Calculation of parity bits is over perviously calculated parity bits as well as information bits. This article presents a new class of orchard codes which correct double bit errors and single byte errors within a constraint length. The rate of the codes is (n₀1)/n₀ and the constraint length is n₀(4n₀+1) bits. A byte is group of n₀ bits. In the proposed codes, the generation of a present parity bit is affected by the information bits and the parity bits for past 2n₀ clock times. The decoder generates a syndrome sequence and errors are corrected using the syndrome pattern. An error propagation occurs only when the punctuation of a syndrome pattern of length 4n₀+1 is erroneous, but if the successive 4n₀ zero-bits appear in the syndrome sequence, the error propagation does not occur beyond that.
ER -