Results 11 to 20 of about 773 (112)
CRC Codes as Error Correction Codes [PDF]
ICC 2021 - IEEE International Conference on Communications, 2021 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 +3 more sources
Index coding and error correction [PDF]
2011 IEEE International Symposium on Information Theory Proceedings, 2011 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
Combinatorics, Probability and Computing, 2023 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 +3 more sources
Error Correction Code Transformer
Advances in Neural Information Processing Systems 35, 2022 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 +3 more sources
Error-correcting Identifying Codes
CoRR, 2022 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
A new approach to solve the reliability problem in any VoIP steganography system [PDF]
AUT Journal of Mathematics and Computing, 2022 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
Error-correcting codes for multipermutations [PDF]
2013 IEEE International Symposium on Information Theory, 2013 Multipermutations appear in various applications in information theory. New applications such as rank modulation for flash memories and voting have suggested the need to consider error-correcting codes for multipermutations. The construction of codes is challenging when permutations are considered and it becomes even a harder problem for ...
Sarit Buzaglo +3 more
openaire +1 more source
Quantum Error-Correcting Codes Based on Orthogonal Arrays
Entropy, 2023 In this paper, by using the Hamming distance, we establish a relation between quantum error-correcting codes ((N,K,d+1))s and orthogonal arrays with orthogonal partitions.
Rong Yan +3 more
doaj +1 more source
NOISE IMMUNITY CODES DISPLAY IN RELIABILITY CORDINATES
Information and Telecommunication Sciences, 2015 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]
Известия Саратовского университета. Новая серия: Математика. Механика. Информатика, 2022 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