CONSTANT WEIGHT PERFECT AND D-REPRESENTABLE CODES

Zh.G. Margaryan

This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

This work is licensed under Creative Commons Attribution–NonCommercial International License (CC BY-NC 4.0).

Abstract

The problem of the existence of non trivial constant weight perfect codes in the -space defined over GF(2) remains unsolved up to now. It has been proved in the present paper that the problem of the existence of constant weight perfect codes is equivalent to the problem of the existence of D-representable codes in the fixed layer.

Author(s)

Table of Contents

CONSTANT WEIGHT PERFECT AND D-REPRESENTABLE CODES

Abstract

Author(s)

Table of Contents

Related Articles

ON UNIQUENESS OF HOLOMORPHIC AND BOUNDED OUTSIDE THE CLOSED LOGARITHMIC SECTOR FUNCTIONS REPRESENTABLE BY LACUNARY POWER SERIES

COMPUTER DETECTING AND PROCESSING OF THE SIGNALS OF A FLAT-COIL ABSOLUTE-POSITION SENSOR BASED SEISMIC DETECTOR

CONSTANT WEIGHT PERFECT AND D-REPRESENTABLE CODES

Abstract

Subscribe to TheGufo Newsletter​

Subscribe to TheGufo Newsletter