Results 261 to 270 of about 692,674 (293)
On the minimum distance of combinatorial codes
IEEE Transactions on Information Theory, 1990 A conjecture of V.C. Da Rocha (see Electron. Lett., vol.21, no.21, p.949-50, 1985) concerning the minimum distance of a class of combinatorial codes is proved. >
L Tolhuizen, J H Van Lint
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Data Compression Conference, 2003. Proceedings. DCC 2003, 2003
Summary form only given. A novel binary entropy code, called combinatorial coding (CC), is presented. The theoretical basis for CC has been described previously under the context of universal coding, enumerative coding, and minimum description length. The code described in these references works as follows: assume the source data are binary of length M,
Vito Dai, Avideh Zakhor
openaire +2 more sources
Summary form only given. A novel binary entropy code, called combinatorial coding (CC), is presented. The theoretical basis for CC has been described previously under the context of universal coding, enumerative coding, and minimum description length. The code described in these references works as follows: assume the source data are binary of length M,
Vito Dai, Avideh Zakhor
openaire +2 more sources
Coding Combinatorial Sources With Costs
IEEE Transactions on Information Theory, 2003Summary: We consider coding infinite sequences of a finite alphabet. The source is defined as a set of sequences (combinatorial source). The problem is to minimize the worst asymptotic compression ratio between each sequence and its coding output among the sequences in the combinatorial source.
Joe Suzuki, Boris Ryabko
openaire +2 more sources
Combinatorial batch codes and transversal matroids
Advances in Mathematics of Communications, 2010 Combinatorial batch codes were defined by Paterson, Stinson, and Wei as purely combinatorial versions of the batch codes introduced by Ishai, Kushilevitz, Ostrovsky, and Sahai. There are $n$ items and $m$ servers each of which stores a subset of the items.
Michael Schroeder, Richard A Brualdi
exaly +2 more sources
Combinatorial properties of frameproof and traceability codes
IEEE Transactions on Information Theory, 2001Summary: In order to protect copyrighted material, codes may be embedded in the content or codes may be associated with the keys used to recover the content. Codes can offer protection by providing some form of traceability (TA) for pirated data. Several researchers have studied different notions of TA and related concepts in recent years.
Ruizhong Wei, D R Stinson
exaly +5 more sources
A Combinatorial Construction of Perfect Codes
SIAM Journal on Algebraic and Discrete Methods, 1983The author gives a combinatorial construction (doubling construction) for perfect single error correcting codes. In another paper, he has generalized this construction [ibid. 5, 224-228 (1984; Zbl 0546.94015)].
exaly +2 more sources
Combinatorial Geometry and Coding Theory*
Fundamenta Informaticae, 2016In this paper, we overview three closely related problems: Nelson–Hadwiger problem on coloring spaces with forbidden monochromatics distances; Borsuk’s problem on partitioning sets in spaces into parts of smaller diameter; problem of finding codes with forbidden Hamming distances.
openaire +3 more sources
A Survey of Combinatorial Gray Codes
SIAM Review, 1997Summary: The term combinatorial Gray code was introduced in 1980 to refer to any method for generating combinatorial objects so that successive objects differ in some prespecified, small way. This notion generalizes the classical binary reflected Gray code scheme for listing n-bit binary numbers so that successive numbers differ in exactly one bit ...
openaire +3 more sources
Combinatorial systematic switch codes
2015 IEEE International Symposium on Information Theory (ISIT), 2015Multiport switches are commonly used as data processing and routing devices in computer networks. A network switch routes data packets between its multiple input and output ports. Packets from input ports are stored upon arrival in a switch fabric comprising multiple memory banks.
Yeow Meng Chee +3 more
openaire +2 more sources
Repair efficient storage codes via combinatorial configurations
, 2014 Fractional repetition (FR) codes are a special class of regenerating codes characterized by the exact and uncoded repair property. In this work, we propose an explicit method to construct FR codes from combinatorial configurations.
Kenneth Shum, Bing Zhu
exaly +2 more sources