Titlebook: Coding Theory and Applications; 2nd International Ca ángela Barbero Conference proceedings 2008 Springer-Verlag Berlin Heidelberg 2008 Alge

鋼筆記下懲罰

On the Kronecker Product Construction of Completely Transitive ,-Ary Codes,For any integer .?≥?1 and for any prime power ., the explicit construction of an infinite family of completely transitive (and completely regular) .-ary codes with minimum distance .?=?3 and with covering radius . is given.

娘娘腔

壯觀的游行

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/228892.jpg

教育學(xué)

M. Guala,K. T. Christensen,R. J. Adrianof the notion of completely regular codes, given by Delsarte [3]. This problem of existence of such structures is closely related to Delsarte hypothesis about the nonexistence of nontrivial perfect codes in Johnson graphs, the problem of existence of block schemes, the problem of existence of comple

虛度

Affectation

重疊

親密

https://doi.org/10.1007/978-94-011-4930-3esent two results that show different applications of algebraic methods in coding theory. One of them refers to the classical context and another one to the quantum error correcting theory. These results can be found in [5] and [13] respectively, where proofs and more details can be found.

新陳代謝

F. Watchorn,G. J. Nichols,D. W. J. Bosenceistortions have upon the Kolmogorov complexity and the clustering by compression technique (the latter based on Normalized Compression Distance, NCD). We show how to decrease the complexity of the considered books introducing several modifications in them. We measure how the information contained in

尊嚴(yán)