1993
DOI: 10.1109/12.237724
|View full text |Cite
|
Sign up to set email alerts
|

On theory and fast algorithms for error correction in residue number system product codes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
39
0

Year Published

1998
1998
2016
2016

Publication Types

Select...
3
3
2

Relationship

0
8

Authors

Journals

citations
Cited by 36 publications
(39 citation statements)
references
References 15 publications
0
39
0
Order By: Relevance
“…Based onr r r (k) , the estimate to the message X k transmitted by the kth CRU can be recovered by the IRNST operation, for example, with the aid of the CRT [15]. Furthermore, when the RRNS is considered, the ratio statistic test (RST) assisted erasure-only decoding, error-correction-only decoding or the RST-assisted error-and-erasure decoding [16,17] can be employed to decoder r r (k) and recover the message X k transmitted.…”
Section: Bank Of Correctors For Receivingmentioning
confidence: 99%
See 2 more Smart Citations
“…Based onr r r (k) , the estimate to the message X k transmitted by the kth CRU can be recovered by the IRNST operation, for example, with the aid of the CRT [15]. Furthermore, when the RRNS is considered, the ratio statistic test (RST) assisted erasure-only decoding, error-correction-only decoding or the RST-assisted error-and-erasure decoding [16,17] can be employed to decoder r r (k) and recover the message X k transmitted.…”
Section: Bank Of Correctors For Receivingmentioning
confidence: 99%
“…In this RNS, any integer 0 ≤ X < M ≤ Q s i=1 mi can be uniquely and unambiguously represented by a residue sequence (r1, r2, ..., rs), where ri = X mod mi represents the residue of X with respect to mi, 0 ≤ ri < mi. Reversely, in this RNS, given an s-tuple residue sequence (r1, r2, ..., rs) with 0 ≤ ri < mi, i = 1, ..., s, according to the Chinese reminder theorem (CRT) [15], there exists one and only one integer 0 ≤ X < M satisfying ri = X mod mi. In other words, if (r1, r2, ..., rs) conveys a message X, it can be recovered uniquely and unambiguously with the aid of, for example, the Chinese reminder theorem.…”
Section: Rrns-assisted Mc/ds-cdma Dynamic Multiple-access a Rnsmentioning
confidence: 99%
See 1 more Smart Citation
“…By contrast, the notation will be used in the context of MUD to be introduced in Section III, which will be referred to as the th user's MUD address. According to the Chinese remainder theorem (CRT) [27], for any given -tuple , where , there exists one and only one integer such that and , which allows us to uniquely recover the integer value of from the received residue digits. Again, represents the FH address of user .…”
Section: B Rns-based Ffhmentioning
confidence: 99%
“…T HE SO-CALLED residue number system (RNS) [1]- [3] has two inherent features that render the RNS attractive in comparison to conventional weighted number systems, such as for example the binary representation. These two features are [2]: 1) the carry-free arithmetic and 2) the lack of ordered significance amongst the residue digits.…”
Section: Introductionmentioning
confidence: 99%