DocumentCode :
938272
Title :
Computerised search for linear binary codes
Author :
Hashim, Ahmad Affendi ; Pozdniakov, V.S.
Author_Institution :
Polytechnic of North London, Department of Electronic & Communications Engineering, London, UK
Volume :
12
Issue :
14
fYear :
1976
Firstpage :
350
Lastpage :
351
Abstract :
A computerised search procedure is described for finding new binary codes The method involves the extension of a given known code by annexing a number of parity-check digits to it in such a way that the minimum Hamming distance of the given code is improved. A number of codes found by this procedure have better rates than the best known codes of identical Hamming distance and the same number of information digits; a table of these codes is presented.
Keywords :
codes; communications applications of computers; computerised search procedure; linear binary codes; minimum Hamming distance; parity check digits;
fLanguage :
English
Journal_Title :
Electronics Letters
Publisher :
iet
ISSN :
0013-5194
Type :
jour
DOI :
10.1049/el:19760268
Filename :
4239854
Link To Document :
بازگشت