Results 241 to 250 of about 2,707,764 (285)
Some of the next articles are maybe not open access.
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
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
Error correcting coding for OTN
IEEE Communications Magazine, 2010Forward 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 +2 more
openaire +1 more source
A Bound for Error-Correcting Codes
IBM Journal of Research and Development, 1960This 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 +2 more sources
Network coding and error correction
Proceedings of the IEEE Information Theory Workshop, 2003We 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 +2 more sources
Error Detecting and Error Correcting Codes
Bell System Technical Journal, 1950The author was led to the study given in this paper from a consideration of large scale computing machines in which a large number of operations must be performed without a single error in the end result. This problem of “doing things right” on a large scale is not essentially new; in a telephone central office, for example, a very large number of ...
openaire +3 more sources
On the Trustworthiness of Error-Correcting Codes
IEEE Transactions on Information Theory, 2007The use of error-correcting codes protects data against accidental or intentional errors, but to what extent can a decoded message be trusted? To answer this question, one has to take the role of the receiver. First, the maximum number of errors Lambda acceptable for decoding is fixed. With the weight distribution, the probability of false decoding can
openaire +2 more sources
Error-correcting codes and cryptography
Applicable Algebra in Engineering, Communication and Computing, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hideki Imai, Manabu Hagiwara
openaire +1 more source
Metacyclic error-correcting codes
Applicable Algebra in Engineering, Communication and Computing, 1995The group codes are ideals of group algebras. Let \(G\) and \(H\) be groups of the same order, \(F\) be a finite field, let \(FG\) and \(FH\) be the corresponding group rings. The combinatorial equivalence is an \(F\) vector space isomorphism \(\gamma: FG\to FH\) induced by a bijection \(\gamma: G\to H\). Codes \(C1 \subseteq FG\) and \(C2 \subseteq FH\
Roberta Evans Sabin, Samuel J. Lomonaco
openaire +2 more sources
1979
In Chapter I-13, we looked at ways of coding messages so that if in the transmission an error occurred in one of the digits of a coded word, the receiver would be able to correct the error. Those codes, called Hamming codes, were based on defining coded words as vectors of solutions in ℤ2 to sets of linear equations.
openaire +1 more source
In Chapter I-13, we looked at ways of coding messages so that if in the transmission an error occurred in one of the digits of a coded word, the receiver would be able to correct the error. Those codes, called Hamming codes, were based on defining coded words as vectors of solutions in ℤ2 to sets of linear equations.
openaire +1 more source
IEEE Transactions on Information Theory, 1973
The purpose of this paper is to develop more general techniques for the synthesis of error-correcting codes that dispense with the requirement that coding elements and operations must be associated with finite fields. This approach permits an extension of the class of coded messages and coding operations and leads in certain cases to a reduction of ...
openaire +2 more sources
The purpose of this paper is to develop more general techniques for the synthesis of error-correcting codes that dispense with the requirement that coding elements and operations must be associated with finite fields. This approach permits an extension of the class of coded messages and coding operations and leads in certain cases to a reduction of ...
openaire +2 more sources