Share This Article:

On the Automorphism Group of Distinct Weight Codes

Abstract Full-Text HTML XML Download Download as PDF (Size:356KB) PP. 80-92
DOI: 10.4236/iim.2015.72008    9,799 Downloads   10,231 Views  


In this work, we study binary linear distinct weight codes (DW-code). We give a complete classification of -DW-codes and enumerate their equivalence classes in terms of the number of solutions of specific Diophantine Equations. We use the Q-extension program to provide examples.

Conflicts of Interest

The authors declare no conflicts of interest.

Cite this paper

Haily, A. and Harzalla, D. (2015) On the Automorphism Group of Distinct Weight Codes. Intelligent Information Management, 7, 80-92. doi: 10.4236/iim.2015.72008.


[1] Bouyukliev, I. (2007) About the Code Equivalence, Advances in Coding Theory and Cryptology. In: Shaska, T., Huffman, W.C., Joyner, D. and Ustimenko, V., Eds., Series in Coding Theory and Cryptology, World Scientific Publishing, Vol. 3, 126-151.
[2] MacWilliams, F.J. and Sloane, N.J.A. (1977) The Theory of Error-Correcting Codes. Elsevier-North-Holland, Amsterdam.
[3] MacWilliams, F.J. (1962) Combinatorial Problems of Elementary Abellan Groups. Ph.D. Dissertation, Harvard University, Cambridge.
[4] Bogart, K., Goldberg, D. and Gordon, J. (1978) An Elementary Proof of the MacWilliams Theorem on Equivalence of Codes. Information and Control, 37, 19-22.
[5] Bouyukliev, I.G. (2007) What Is Q-Extension? Serdica Journal of Computing, 1, 115-130.

comments powered by Disqus

Copyright © 2020 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.