๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Correcting codes for arithmetic errors

โœ Scribed by V.M. Mikhelev

Publisher
Elsevier Science
Year
1965
Weight
543 KB
Volume
5
Category
Article
ISSN
0041-5553

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Codes for detecting and correcting propa
Codes for detecting and correcting propagation errors
โœ S. Al-Bassam; R. Venkatesan; B. Bose ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 376 KB

An (m) error at bit i causes bits i,i + 1,..., and i+ m -1 (or up to the end of the word) to be in error, inflicting m consecutive errors. The most practical cases are when m --2 which is referred to as adjacent errors and when m --n (the length of the word) in which an error causes the rest of the

Codes for perfectly correcting errors of
Codes for perfectly correcting errors of limited size
โœ Samira Saidi ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 749 KB

Saidi S., Codes for perfectly correcting errors of limited size, Discrete Mathematics 118 (1993) 207-223. In this paper we study an analogue of perfect codes: codes that perfectly correct errors of limited size, assuming that there is a bound on the number of these errors. Stein's (m, n) crosses (

Error-correcting codes
Error-correcting codes
๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 38 KB
Permutationally invariant codes for quan
Permutationally invariant codes for quantum error correction
โœ Harriet Pollatsek; Mary Beth Ruskai ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 408 KB

A permutationally invariant n-bit code for quantum error correction can be realized as a subspace stabilized by the non-Abelian group S n . The code is spanned by bases for the trivial representation, and all other irreducible representations, both those of higher dimension and orthogonal bases for