Results 81 to 90 of about 773 (112)
Some of the next articles are maybe not open access.
On error-correcting balanced codes
IEEE Transactions on Information Theory, 1989Results 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
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 +1 more source
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 +1 more source
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 +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
Multiple error-correcting WOM-codes
2010 IEEE International Symposium on Information Theory, 2010A Write Once Memory (WOM) is a storage medium with binary memory elements, called cells, that can change from the zero state to the one state only once. Examples of WOMs are punch cards, optical disks, and more recently flash memories. WOM-codes were first presented by Rivest and Shamir and are designed for efficiently storing and updating data in the ...
Eitan Yaakobi +3 more
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, 2019
Coding schemes are presented that provide the ability to locate computational errors above a prescribed threshold while using analog resistive devices for approximate real vector–matrix multiplication. In such devices, the matrix is programmed into the device by setting an array of resistors to have conductances proportional to the respective entries ...
openaire +1 more source
Coding schemes are presented that provide the ability to locate computational errors above a prescribed threshold while using analog resistive devices for approximate real vector–matrix multiplication. In such devices, the matrix is programmed into the device by setting an array of resistors to have conductances proportional to the respective entries ...
openaire +1 more source
Error-Correcting Codes in Projective Space
2008 IEEE International Symposium on Information Theory, 2008The projective space of order n over the finite field Fq, denoted Pq(n), is the set of all subspaces of the vector space Fn q. The distance function d(U,V) = dim U + dim V - 2 dim(UcapV) turns Pq(n) into a metric space. With this, an (n, M, d) code C in projective space is a subset of Pq(n) of size M such that the distance between any two codewords ...
Tuvi Etzion, Alexander Vardy
openaire +1 more source