Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Transactions on Information Theory

A note on one-step majority-logic decodable codes (Corresp.)

Chin-Long Chen, W. J. Warren

Published Jan 1, 1973• 2 citations
Publisher

Abstract

Construction of shortened geometric codes as Shown here results in 1-step majority-logic deeodable codes. The shortened codes retain the error-correction ability of the parent codes and the decoders for the shortened codes are much simpler than for the parent code. A table of shortened codes is given.
DOI
10.1109/tit.1973.1054940

Related papers

Further results on majority-logic decoding of product codes (Corresp.)

Nguyen Quang Đuc, L.V. Skattebol

In this correspondence additional results on majority-logic decoding of product codes are presented. If one of the component codes is decodable using Rudolph's nonorthogonal algorithm, and the other using Reed-Massey'sL-step orthogonalization, then the resulting product code is majority-logic decodable inLsteps, where nonorthogonal checks are used in the first step and orthogonal checks in the remaining steps. If the component codes are both decodable using Rudolph's algorithm, the product code is majority-logic decodable using the same procedure.

IEEE Transactions on Information Theory•Mar 1, 1972•1 citation

On binary majority-logic decodable codes (Corresp.)

S. Shiva, Stafford E. Tavares

LetV\primebe a binary(n,k)majority-logic decodable code withg\prime (X)as its generator polynomial and odd minimum distanced. LetVbe the(n, k - 1)subset code generated byg\prime (X)(1 + X). This correspondence shows thatVis majority-logic deeodable withd + 1orthogonal estimates. This fact is useful in the simultaneous correction of random errors and erasures.

IEEE Transactions on Information Theory•Jan 1, 1974•1 citation

Generalized minimum distance decoding on majority logic decodable codes (Corresp.)

Tai-Yang Hwang, Sheng-Uei Guan

Generalized minimum distance decoding schemes are found for majority logic decodable codes. These decoding schemes are parallel to the classical majority logic decoding schemes and thus can be easily implemented.

IEEE Transactions on Information Theory•Sep 1, 1982•0 citations

A class of majority logic decodable codes (Corresp.)

L. Rudolph

IEEE Transactions on Information Theory•Apr 1, 1967•133 citations

Majority decoding the nonorthogonal parity checks (Corresp.)

Chin-Long Chen

A new bound on the error-correcting capability of majority decoding using nonorthogonal parity checks is derived. The new bound is then applied to a class of Euclidean geometry codes.

IEEE Transactions on Information Theory•Nov 1, 1976•1 citation

Gradient-descent decoding of one-step majority-logic decodable codes

Anouar Yatribi, Mostafa Belkasmi, Fouad Ayoub

Physical Communication•Jan 10, 2020•6 citations
In this correspondence additional results on majority-logic decoding of product codes are presented. If one of the component codes is decodable using Rudolph's nonorthogonal algorithm, and the other using Reed-Massey'sL-step orthogonalization, then the resulting product code is majority-logic decodable inLsteps, where nonorthogonal checks are used in the first step and orthogonal checks in the remaining steps. If the component codes are both decodable using Rudolph's algorithm, the product code is majority-logic decodable using the same procedure.