2005•Unpublished venueRequires access

Algebraic Structure and Decoding of Two-Dimensional Cascade Codes

K. Saints, C. Heegard

Abstract

This paper discusses the algebraic structure of cascaded Reed-Solomon (CRS) codes, and presents an algorithm for decoding them. A CRS code is a cascade (or "generalized concatenated" ) code constructed using Reed-Solomon codes as component codes. In particular, we consider hyperbolic CRS (HCRS) codes: these are CRS codes designed to have the minimum distance given by the cascade code bound. Compared to Reed-Solomon codes over the same alphabet, HCRS codes have longer block-lengths. Compared to other two dimensional cyclic codes (products of Reed-Solomon codes, duals of such products, and codes proposed by Sakata [1]) with the same minimum distance, HCRS codes have higher rates.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Concatenated error correction code, Reed–Solomon error correction, Block code, Linear code, Reed–Muller code, Tornado code, Expander code, Hamming code