Results 191 to 200 of about 858,459 (235)
Some of the next articles are maybe not open access.
Group Code Equivalence and Optimum Codes
IRE Transactions on Circuit Theory, 1959This paper describes a search for optimum group codes using the IBM 704 computer. Some theory of the relation. ship between equivalent codes used in narrowing the search is described, and the method of searching is outlined. The newly found optimum codes are listed, along with a number of counter-examples to typical conjectures on binary group codes.
A. Fontaine, W. Peterson
openaire +1 more source
Journal of Electronic Imaging, 2014
The representation of images is an active and very important area in image processing and pattern recognition. Therefore, in the literature, different contour codes for binary images have been proposed, such as F4;F8;VCC;3OT, and AF8. These codes have been used in many papers since the first chain code, F8, was introduced by Freeman in 1961.
Hermilo Sánchez-Cruz +1 more
openaire +1 more source
The representation of images is an active and very important area in image processing and pattern recognition. Therefore, in the literature, different contour codes for binary images have been proposed, such as F4;F8;VCC;3OT, and AF8. These codes have been used in many papers since the first chain code, F8, was introduced by Freeman in 1961.
Hermilo Sánchez-Cruz +1 more
openaire +1 more source
On equivalent classes of minimal Abelian codes
Journal of Combinatorial Theory, Series A, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yuan Ren, Dongchun Han
openaire +2 more sources
Switching Equivalence Classes of Perfect Codes
Designs, Codes and Cryptography, 1999A binary 1-error correcting perfect code is called switching equivalent to the Hamming code (of the same parameters) if there is a sequence of switches (replacing a specially selected set of codewords for another set of words) which leads to the Hamming code. \textit{S. V. Avgustinovich} and \textit{F. I.
Phelps, Kevin T., LeVan, Mike
openaire +1 more source
Testing efficiency transfer codes for equivalence
Applied Radiation and Isotopes, 2010Four general Monte Carlo codes (GEANT3, PENELOPE, MCNP and EGS4) and five dedicated packages for efficiency determination in gamma-ray spectrometry (ANGLE, DETEFF, GESPECOR, ETNA and EFFTRAN) were checked for equivalence by applying them to the calculation of efficiency transfer (ET) factors for a set of well-defined sample parameters, detector ...
T, Vidmar +14 more
openaire +2 more sources
Multiplier Equivalence Of Cyclic Codes
Proceedings. 1991 IEEE International Symposium on Information Theory, 2005A multiplier is a permutation of S, given by i -+ ai(mod n) where gcd(a,n) = 1. It is known that if two cyclic codes of prime length p are equivalent, then they must also be multiplier equivalent. We show that this same result holds for cyclic codes of length n whenever (n,d(n)) = 1. Let C and C’ be cyclic codes of length pr with p and T primes, p > T,
W.C. Huffman, V. Job, V. Pless
openaire +1 more source
A code equivalence between streaming network coding and streaming index coding
2017 IEEE International Symposium on Information Theory (ISIT), 2017We consider a delay-constrained streaming model for zero-error communications and show that under this model, network coding and index coding problems are code equivalent. That is, any streaming network coding instance can be efficiently mapped to a corresponding acyclic streaming index coding instance such that an index code for the latter can be ...
Wong, Ming Fai +2 more
openaire +2 more sources
The Equivalence of Certain Harper Codes
Bell System Technical Journal, 1969A class of binary encoding algorithms called Harper codes has been studied previously as a means of encoding numbers for transmission over an idealized binary channel. This paper considers a more general and practical transmission system model. For any Harper code, it presents a technique for obtaining the expression for the average absolute numerical ...
openaire +2 more sources
Equivalent irreducible Goppa codes (Corresp.)
IEEE Transactions on Information Theory, 1978Irreducible Goppa codes extended with an overall parity check are shown to be cyclic or shortened cyclic codes. The location points of a codeword of the extended irreducible codes can be designated as the points of a finite projective geometry. Bounds on the number of equivalence classes of both irreducible and extended irreducible Goppa codes are ...
openaire +1 more source