#### Filter Results:

#### Publication Year

1986

2016

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

—We propose a new type of short to moderate block-length, linear error-correcting codes, called moderate-density parity-check (MDPC) codes. The number of one's of the parity-check matrix of the codes presented is typically higher than the number of one's of the parity-check matrix of low-density parity-check (LDPC) codes. But, still lower than those of the… (More)

AMrcrct-An approach for efficient utilization of fast Hadamard transform in decoding binary linear block codes is presented. Computational gain is obtained by employing various types of concurring codewords, and memory reduction is also achieved by appropriately selecting rows for the generator matix. The availability of these codewords in general, and… (More)

The problem of efficient maximum-likelihood soft decision decoding of binary BCH codes is considered. It is known that those primitive BCH codes whose designed distance is one less than a power of two, contain subcodes of high dimension which consist of a direct sum of several identical codes. We show that the same kind of direct-sum structure exists in all… (More)