Architecture for a low complexity rate-adaptive Reed-Solomon encoder

DOI10.1109/12.392853zbMath1057.68528MaRDI QIDQ4421232

Vijay K. Bhargava, M. Anwarul Hasan

Publication date: 10 November 2003

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/12.392853

zbMATH Keywords

finite field multiplication; multiple error-correcting Reed-Solomon codes

Mathematics Subject Classification ID

68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)

68M15: Reliability, testing and fault tolerance of networks and computer systems

Related Items

A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers