Pairs of codes with prescribed Hamming distances and coincidences

ISSN： 0925-1022

Source： Designs, Codes and Cryptography, Vol.41, Iss.1, 2006-10, pp. : 87-99

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On circulant codes with prescribed distances

Bulletin of the Australian Mathematical Society, Vol. 16, Iss. 3, 1977-06 ,pp. : 361-369

Cambridge University Press

Access to resources Recommend Favorite

ELUSIVE CODES IN HAMMING GRAPHS

Bulletin of the Australian Mathematical Society, Vol. 88, Iss. 2, 2013-10 ,pp. : 286-296

Cambridge University Press

Access to resources Recommend Favorite

Completely Transitive Codes in Hamming Graphs

By Giudici M. Praeger C.E.

European Journal of Combinatorics, Vol. 20, Iss. 7, 1999-10 ,pp. : 647-662

Elsevier

Access to resources Recommend Favorite

Maximum Distance Codes in Mat_n,s (Z_k) with a Non-Hamming Metric and Uniform Distributions

By Dougherty Steven T. Shiromoto Keisuke

Designs, Codes and Cryptography, Vol. 33, Iss. 1, 2004-08 ,pp. : 45-61

Springer Publishing Company

Access to resources Recommend Favorite

An Algorithm for Computing the Minimum Distances of Extensions of BCH Codes Embedded in Semigroup Rings

By Cazaran J. Kelarev A.V. Quinn S.J. Vertigan D.

Semigroup Forum, Vol. 73, Iss. 3, 2006-12 ,pp. : 317-329

Springer Publishing Company

Access to resources Recommend Favorite