Results 281 to 290 of about 13,959 (300)
Some of the next articles are maybe not open access.
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 +2 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 +1 more source
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 +2 more sources
Combinatorial constructions of separating codes
Journal of ComplexityzbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marcel Fernández +2 more
openaire +2 more sources
Combinatorial characterizations of authentication codes II
Designs, Codes and Cryptography, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rolf S. Rees, Douglas R. Stinson
openaire +2 more sources
Covering codes and combinatorial optimization
1991It was proved by Ntafos and Hakimi in 1981 (and rediscovered recently by T. Zaslavsky and the author) that cycle codes of graphs could be completely decoded in polynomial time, by reduction to the Chinese Postman problem, and use of the Edmonds and Johnson algorithm.
openaire +1 more source
Coverings, centered codes, and combinatorial steganography
Problems of Information Transmission, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fabien Galand, Gregory A. Kabatiansky
openaire +1 more source
Combinatorial and LP bounds for LRC codes
2016 IEEE International Symposium on Information Theory (ISIT), 2016A locally recoverable (LRC) code is a code that enables a simple recovery of an erased symbol by accessing only a small number of other symbols. We present several new combinatorial bounds on LRC codes including the locality-aware sphere packing and Plotkin bounds. We also develop an approach to linear programming (LP) bounds on LRC codes.
Sihuang Hu, Itzhak Tamo, Alexander Barg
openaire +1 more source
Combinatorial Designs for Authentication and Secrecy Codes
Foundations and Trends® in Communications and Information Theory, 2010Combinatorial design theory is a very active area of mathematical research, with many applications in communications and information theory, computer science, statistics, engineering, and life sciences. As one of the fundamental discrete structures, combinatorial designs are used in fields as diverse as error-correcting codes, statistical design of ...
openaire +1 more source
Lower Bounds for Total Storage of Multiset Combinatorial Batch Codes Using Linear Programming
IEEE Transactions on Information Theory, 2021Yeow Meng Chee, Han Mao Kiah, Hui Zhang
exaly