NDLI: A robust Chinese Remainder Theorem with applications in error correction coding

Content Provider	IEEE Xplore Digital Library
Author	Li Xiao Xiang-Gen Xia
Copyright Year	2015
Description	Author affiliation: Xidian Univ., Xi'an, China (Xiang-Gen Xia) \|\| Dept. of Electr. & Comput. Eng., Univ. of Delaware, Newark, DE, USA (Li Xiao)
Abstract	This paper investigates polynomial remainder codes with non-pairwise coprime moduli. We first propose a robust reconstruction for polynomials from erroneous residues when the degrees of all residue errors are small, namely robust Chinese Remainder Theorem (CRT) for polynomials. It basically says that a polynomial can be reconstructed from erroneous residues such that the degree of the reconstruction error is upper bounded by τ whenever the degrees of all residue errors are upper bounded by τ, where a sufficient condition for τ and a reconstruction algorithm are obtained. By relaxing the constraint that all residue errors have small degrees, another robust reconstruction is then presented when there are multiple unrestricted errors and an arbitrary number of errors with small degrees in the residues. By making full use of redundancy in moduli, we obtain a stronger residue error correction capability in the sense that apart from the number of errors that can be corrected in the previous existing result, some errors with small degrees can be also corrected in the residues. With this newly obtained result, improvements in uncorrected error probability and burst error correction capability in a data transmission are illustrated.
Starting Page	181
Ending Page	185
File Size	197631
Page Count	5
File Format	PDF
ISSN	21578117
e-ISBN	9781467377041
DOI	10.1109/ISIT.2015.7282441
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2015-06-14
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Polynomials Robustness Decoding Error correction codes Error correction Error probability Encoding
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Algebraic geometry code decoding based on Chinese remainder theorem

Error Correction in Polynomial Remainder Codes with Non-Pairwise Coprime Moduli and Robust Chinese Remainder Theorem for Polynomials

A Novel Robust Watermarking Algorithm Based on Error Correction Coding

A Distributed Product Coding Approach For Robust Network Coding

Coding for informed decoders

Robust speech decoding: can error concealment be better than error correction?

On irreducible polynomial remainder codes

Decoding of parallel Reed-Solomon codes with applications to product and concatenated codes

A novel error correction scheme based on the Chinese remainder theorem

A robust Chinese Remainder Theorem with applications in error correction coding

Similar Documents

Algebraic geometry code decoding based on Chinese remainder theorem

Error Correction in Polynomial Remainder Codes with Non-Pairwise Coprime Moduli and Robust Chinese Remainder Theorem for Polynomials

A Novel Robust Watermarking Algorithm Based on Error Correction Coding

A Distributed Product Coding Approach For Robust Network Coding

Coding for informed decoders

Robust speech decoding: can error concealment be better than error correction?

On irreducible polynomial remainder codes

Decoding of parallel Reed-Solomon codes with applications to product and concatenated codes

A novel error correction scheme based on the Chinese remainder theorem

A robust Chinese Remainder Theorem with applications in error correction coding