Comments on “Integer SEC-DED codes for low power communications” [Inform. Process. Lett. 110 (2010) 518–520]

Bajić, Dragana; Burr, Alister G.

doi:10.1016/j.ipl.2011.01.003

Cited by 2 publications

(1 citation statement)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To the authors' best knowledge, apart from [9][10][11][12]14], no solutions propose a single bit error correction with modulo operations only, without binary and/or real number operations.…”

Section: Low Power Integer Codes For Unequal Length Packetsmentioning

confidence: 99%

A hybride procedure with selective retransmission for aggregated packets of unequal length

Bajić

Dimić

Zogovic

2013

2013 IEEE International Conference on Communications (ICC)

Self Cite

View full text Add to dashboard Cite

This paper introduces a hybrid aggregated packet (or fragment) procedure with selective retransmission, based on low power integer codes. The protection at aggregated level is performed using two checksums. In a case of detected error, intermediary results of coding procedure -two auxiliary checksums per packet -are used as incremental redundancy. Auxiliary syndromes at the receiver then determine further actioneither error correction at packet level and correction verification at the aggregated level, or selective retransmission. Energy saving is achieved by the low power coding procedure. The performance analyses include retransmission, redundancy, delay and residual packet error rate.

show abstract

Section: Low Power Integer Codes For Unequal Length Packetsmentioning

confidence: 99%

A hybride procedure with selective retransmission for aggregated packets of unequal length

Bajić

Dimić

Zogovic

2013

2013 IEEE International Conference on Communications (ICC)

Self Cite

View full text Add to dashboard Cite

show abstract

Splitting Sequences for Coding and Hybrid Incremental ARQ with Fragment Retransmission

2021

View full text Add to dashboard Cite

This paper proposes a code defined on a finite ring ℤpM, where pM = 2m−1 is a Mersenne prime, and m is a binary size of ring elements. The code is based on a splitting sequence (splitting set) S, defined for the given multiplier set ℰ={±20, ±21,…, ±2m−1}. The elements of ℰ correspond to the weights of binary error patterns that can be corrected, with the bidirectional single-bit error being the representative that occurs the most. The splitting set splits the code-word into sub-words, which inspired the name splitting code. Each sub-word, provided with auxiliary control symbols that are a byproduct of the coding procedure, corrects a single symbol error. The code can be defined, with some constraints, for general Mersenne numbers as well, while the multiplier set can be adjusted for adjacent binary errors correction. The application proposed for this code is a hybrid three-stage incremental ARQ procedure that transmits the code-word in the first stage, auxiliary control symbols in the second stage, and retransmits the sub-words detected as incorrect in the third stage. At each stage, error correction can be turned on or off, keeping both the retransmission rate and residual error rate at a low level.

show abstract

Comments on “Integer SEC-DED codes for low power communications” [Inform. Process. Lett. 110 (2010) 518–520]

Cited by 2 publications

References 3 publications

A hybride procedure with selective retransmission for aggregated packets of unequal length

A hybride procedure with selective retransmission for aggregated packets of unequal length

Splitting Sequences for Coding and Hybrid Incremental ARQ with Fragment Retransmission

Contact Info

Product

Resources

About