Fault-Tolerant Convolution Via Chinese Remainder Codes Constructed From Non-Coprime Moduli

DOI10.1109/TSP.2008.924636MaRDI QIDQ4568775zbMATH OpenOpenAlexFDO

Authors Shreyas Sundaram, Christoforos N. Hadjicostis

Publication date 27 June 2018

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)

Cited in

(1)

• Fast algorithm for ``error-free convolution computation using Mersenne--Lucas codes

This page was built for publication: Fault-Tolerant Convolution Via Chinese Remainder Codes Constructed From Non-Coprime Moduli

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4568775)