Results 271 to 280 of about 692,674 (293)
Some of the next articles are maybe not open access.
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 +3 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 +3 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
A generalization of combinatorial designs and related codes
Designs, Codes and Cryptography, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jerod Michel, Baokun Ding
openaire +3 more sources
Lower Bounds for Total Storage of Multiset Combinatorial Batch Codes Using Linear Programming
IEEE Transactions on Information Theory, 2021Han Mao Kiah, Yeow Meng Chee
exaly
Locally repairable codes from combinatorial designs
Science China Information Sciences, 2020Yu Zhang, Haibin Kan, Kan Haibin
exaly
Combinatorial Properties for Traceability Codes Using Error Correcting Codes
IEEE Transactions on Information Theory, 2007Mario Blaum, Hongxia Jin
exaly
Combinatorial batch codes: A lower bound and optimal constructions
Advances in Mathematics of Communications, 2012Sushmita Ruj +2 more
exaly
Combinatorial Constructions of Optimal Constant-Composition Codes
IEEE Transactions on Information Theory, 2005Ding Cunsheng, Jianxing Yin
exaly