Information Theory

Bounds on Volume of Linear Codes with Unequal Information-Symbol Protection

G. L. Katsman


Abstract: Linear codes with unequal information-symbol protection are investigated. Upper and lower bounds for the volume of these codes are derived.

UDC: 621.391.15:519.2

Received: 07.08.1978
Revised: 30.05.1979

 English version: Problems of Information Transmission, 1980, 16:2, 99–105

Bibliographic databases:

• 
•