Blind identification of code word length for non-binary error-correcting codes in noisy transmission EURASIP Journal on Wireless Communications and Networking Sample doi:10.1186/s13638-015-0294-5 Yasamine Zrelli ([email protected]) Roland Gautier ([email protected]) Eric Rannou ([email protected]) Mélanie Marazin ([email protected]) Emanuel Radoi (eman...

A new technique for correcting synchronization errors in the transmission of discrete-symbol information is developed. The technique can be applied to any t-additive-error-correcting Bose-Chaudhuri-Hocquenghem code, to provide protection against synchronization errors. The synchronization error is corrected at the first complete received word after the word containing the synchronization error,...

One of the most widely used method of error detection and correction is Single Error Correction and Double Error Detection (SEC-DED) code. With any technology, there is a danger that information will be corrupted due to physical imperfections in storage media or electronic noise. So it is necessary to detect and correct such an erroneous data during transmission. Error detection and correction ...

Analysis of quantum error correcting codes is typically done using a stochastic, Pauli channel error model for describing the noise on physical qubits. However, it was recently found that coherent errors (systematic rotations) on physical data qubits result in both physical and logical error rates that differ significantly from those predicted by a Paulimodel. Herewe examine the accuracy of the...

The expression for ω 2,2,r (2t) in Theorem 9 is misprinted in the original publication of this article. It should have been the same as for ω 2,1,r (2t) in Theorem 11. The correct expression in Theorem 9 will be Theorem 9 For q = 2t where t is odd, we have ω 2,2,r (2t) = 1 2 (2 r − 1)(t r + 1) .

In this correspondence, we study binary asymmetric errorcorrecting codes. A general construction for binary asymmetric error-correcting codes is presented. We show that some previously known lower bounds for binary asymmetric error-correcting codes can be obtained from this general construction. Furthermore, some new lower bounds for binary asymmetric error-correcting codes are obtained from th...

In this paper we extend to asymmetric quantum error-correcting codes (AQECC) the construction methods, namely: puncturing, extending, expanding, direct sum and the (u|u + v) construction. By applying these methods, several families of asymmetric quantum codes can be constructed. Consequently, as an example of application of quantum code expansion developed here, new families of asymmetric quant...

Informally, an error-correcting code has “nice” listdecodability properties if every Hamming ball of “large” radius has a “small” number of codewords in it. Here, we report linear codes with non-trivial list-decodability: i.e., codes of large rate that are nicely listdecodable, and codes of large distance that are not nicely list-decodable. Specifically, on the positive side, we show that there...

We investigate the minimum distance of the error correcting code formed by the homomorphisms between two finite groups G and H. We prove some general structural results on how the distance behaves with respect to natural group operations, such as passing to subgroups and quotients, and taking products. Our main result is a general formula for the distance when G is solvable or H is nilpotent, i...

The performance of robust video transmission over wireless fading channels relies on a coordinated protection effort in handling channel and source variations dynamically. Given the relative priority of each source packet and the estimated instantaneous channel condition, an adaptive protection scheme with joint source-channel criteria is investigated via the use of proactive forward error corr...