Results 261 to 270 of about 18,947 (303)

On error-correcting balanced codes

IEEE Transactions on Information Theory, 1989
Results are presented on families of balanced binary error-correcting codes that extend those in the literature. The idea is to consider balanced blocks as symbols over an alphabet and to construct error-correcting codes over that alphabet. Encoding and decoding procedures are presented. Several improvements to the general construction are discussed.
M Blaum
exaly   +2 more sources

Steganography and error-correcting codes

Signal Processing, 2007
CARLOS Munuera
exaly   +2 more sources

Error Correcting Network Codes

Computer Networks, 2021
Abstract Network coding (NC) is a novel forwarding technique that promise to change many aspects of networking. However, the error propagation problem in NC resulting from the encoding on the Network layer makes the error-correcting process performed classically on the Physical layer very expensive in terms of computational resources, especially when
Mohamed Amine Belhamra, El Mamoun Souidi
openaire   +1 more source

Error-Correcting Codes for Flash Coding

IEEE Transactions on Information Theory, 2011
Flash memory is a non-volatile computer storage device which consists of blocks of cells. While increasing the voltage level of a single cell is fast and simple, reducing the level of a cell requires the erasing of the entire block containing the cell. Since block-erasures are costly, traditional flash coding schemes have been developed to maximize the
Qin Huang 0002, Shu Lin 0001, Khaled A. S. Abdel-Ghaffar   +2 more
openaire   +1 more source

Error correcting coding for OTN

IEEE Communications Magazine, 2010
Forward error correction codes for 100 Gb/s optical transmission are currently receiving much attention from transport network operators and technology providers. We discuss the performance of hard decision decoding using product type codes that cover a single OTN frame or a small number of such frames.
Jørn Justesen, Knud J. Larsen, Lars A. Pedersen   +2 more
openaire   +1 more source

Error-correcting codes for correcting bursts of errors

Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics, 1960
In data transmission systems that are subject to noise, it is found that errors do not occur randomly but in bursts. Consequently, much interest has centered lately on the problem of constructing suitable error-correcting codes.
openaire   +2 more sources

Error-correcting WOM-codes

IEEE Transactions on Information Theory, 1991
A problem raised by R.L. Rivest and A. Shamir (1982), namely, constructing write-once-memory (WOM) codes capable of error correction, is considered. The authors call a (n,m,t)-WOM code a scheme that allows t successive writings of m arbitrary bits (i.e., one message among 2/sup m/) on a WOM of size n.
Gilles Zémor, Gérard D. Cohen
openaire   +1 more source

Network coding and error correction

Proceedings of the IEEE Information Theory Workshop, 2003
We introduce network error-correcting codes for error correction when a source message is transmitted to a set of receiving nodes on a network. The usual approach in existing networks, namely link-by-link error correction, is a special case of network error correction. The network generalizations of the Hamming bound and the Gilbert-Varshamov bound are
Ning Cai 0001, Raymond W. Yeung
openaire   +1 more source

A Bound for Error-Correcting Codes

IBM Journal of Research and Development, 1960
This paper gives two new bounds for the code word length n which is required to obtain a binary group code of order 2k with mutual distance d between code words. These bounds are compared with previously known bounds, and are shown to improve upon them for certain ranges of k and d. Values of k and d are given for which one of these bounds can actually
openaire   +1 more source