Results 11 to 20 of about 12,027 (259)
CRC Codes as Error Correction Codes [PDF]
CRC codes have long since been adopted in a vast range of applications. The established notion that they are suitable primarily for error detection can be set aside through use of the recently proposed Guessing Random Additive Noise Decoding (GRAND). Hard-detection (GRAND-SOS) and soft-detection (ORBGRAND) variants can decode any short, high-rate block
Wei An 0001 +2 more
openaire +6 more sources
Index coding and error correction [PDF]
A problem of index coding with side information was first considered by Y. Birk and T. Kol (IEEE INFOCOM, 1998). In the present work, a generalization of index coding scheme, where transmitted symbols are subject to errors, is studied. Error-correcting methods for such a scheme, and their parameters, are investigated.
Son Hoang Dau +2 more
openaire +2 more sources
On the number of error correcting codes
AbstractWe show that for a fixed $q$ , the number of $q$ -ary $t$ -error correcting codes of length $n$ is at most $2^{(1 + o(1)) H_q(n,t)}$ for all $t \leq (1 - q^{-1})n - 2\sqrt{n \log n}$ , where $H_q(n, t) = q^n/ V_q(n,t)$ is the Hamming bound and $V_q(n,t)$ is the cardinality of the radius $t$ Hamming ball.
Dingding Dong, Nitya Mani, Yufei Zhao
openaire +5 more sources
Knot theory and error-correcting codes. [PDF]
Abstract This paper builds a novel bridge between algebraic coding theory and mathematical knot theory, with applications in both directions. We give methods to construct error-correcting codes starting from the colorings of a knot, describing through a series of results how the properties of the knot translate into code parameters.
Kılıç AB +3 more
europepmc +9 more sources
Error Correction Code Transformer
Error correction code is a major part of the communication physical layer, ensuring the reliable transfer of data over noisy channels. Recently, neural decoders were shown to outperform classical decoding techniques. However, the existing neural approaches present strong overfitting due to the exponential training complexity, or a restrictive inductive
Yoni Choukroun, Lior Wolf
openaire +4 more sources
A new approach to solve the reliability problem in any VoIP steganography system [PDF]
VoIP is naturally an unreliable communication system. Thus, using the best VoIP steganographic systems, the accuracy of the hidden message is impaired as a result of the VoIP packet loss.
M.-R Sadeghi +2 more
doaj +1 more source
Blockwise and Low Density Key Error Correcting Codes [PDF]
To protect the information from disturbances created by noisy channels, redundant symbols (called check symbols) with the information symbols are added. These extra symbols play important role for the efficiency of the communication system.
Pankaj Kumar Das, Subodh Kumar
doaj +1 more source
Error-correcting Identifying Codes
Assume that a graph $G$ models a detection system for a facility with a possible "intruder," or a multiprocessor network with a possible malfunctioning processor. We consider the problem of placing (the minimum number of) detectors at a subset of vertices in $G$ to automatically determine if there is an intruder, and if so, its precise location.
Devin C. Jean, Suk Jai Seo
openaire +2 more sources
NOISE IMMUNITY CODES DISPLAY IN RELIABILITY CORDINATES
Background. Noise immunity codes are widely used in the modern telecommunication systems. The methodology of properties count of convolutional codes, offered by authors before, to the equivalent parameters of block codes gave the opportunity to use the ...
Leonid Uryvskyi, Anton Pieshkin
doaj +1 more source
Decoding algorithms for Goppa codes with errors and erasures [PDF]
In 1978, McEliece built the first public key cryptosystem based on error-correcting codes. This cryptosystem based on Goppa codes is considered promising and cryptographically stable, taking into account quantum computing.
Ratseev, Sergey Mihailovich +1 more
doaj +1 more source

