[引用][C] On maximal comma-free codes (corresp.)
Y Niho - IEEE Transactions on Information Theory, 1973 - ieeexplore.ieee.org
On maximal comma-free codes (Corresp.) Page 1 580 IEEE TRANSACTIONS ON
INFORMATION THEORY, JULY 1973 As a result it can be easily seen that a syndrome …
INFORMATION THEORY, JULY 1973 As a result it can be easily seen that a syndrome …
[引用][C] On the construction of comma-free codes
W Eastman - IEEE Transactions on Information Theory, 1965 - ieeexplore.ieee.org
On the construction of comma-free codes Page 1 Eastman: Comma-Free Codes 263 (21)
where we have used t~he symbol XL rather than X,, since the number of terms above depend …
where we have used t~he symbol XL rather than X,, since the number of terms above depend …
[PDF][PDF] Comma-free codes: An extension of certain enumerative techniques to recursively defined sequences
JS Devitt, DM Jackson - Journal of Combinatorial Theory, Series A, 1981 - core.ac.uk
A code C of block length k is a collection of words (sequences) of length k over some finite
alphabet. It is said to be comma-free if a,... ak EC and b,.. I b, EC always imply that the words …
alphabet. It is said to be comma-free if a,... ak EC and b,.. I b, EC always imply that the words …
The comma-free codes with words of length two
AH Ball, LJ Cummings - Bulletin of the Australian Mathematical …, 1976 - cambridge.org
A code not requiring a distinct symbol to separate words is called comma-free. Two codes
are isomorphic if one can be obtained from the other by a permutation of the underlying …
are isomorphic if one can be obtained from the other by a permutation of the underlying …
Path-invariant comma-free codes
W Kendall, I Reed - IRE Transactions on Information Theory, 1962 - ieeexplore.ieee.org
In this paper we define a subclass of comma-free codes which has a property called path
invariance. The main advantage of codes in this subclass lies in the ease of establishing the …
invariance. The main advantage of codes in this subclass lies in the ease of establishing the …
Comma-free codes
SW Golomb, B Gordon, LR Welch - Canadian Journal of …, 1958 - cambridge.org
COMMA-FREE CODES Page 1 COMMA-FREE CODES SW GOLOMB, BASIL GORDON AND
LR WELCH 1. A General Combinatorial Problem. Let n be a fixed positive integer, and …
LR WELCH 1. A General Combinatorial Problem. Let n be a fixed positive integer, and …
Bounds and constructions for ternary constant-composition codes
M Svanstrom, PRJ Ostergard… - IEEE Transactions on …, 2002 - ieeexplore.ieee.org
The problem of determining the maximum size of a ternary code is considered, under the
restriction that each symbol should appear a given number of times in each codeword …
restriction that each symbol should appear a given number of times in each codeword …
[PDF][PDF] Diletter and triletter comma-free codes over finite alphabets
E Fimmel, CJ Michel, F Pirot, JS Sereni, L Strüngmann - 2023 - repository.ubn.ru.nl
Comma-free codes have been widely studied in the last sixty years, from points of view as
diverse as biology, information theory and combinatorics. We develop new methods to study …
diverse as biology, information theory and combinatorics. We develop new methods to study …
Restriction on nonbinary commafree codes
IS Taylor, DH Green - Electronics Letters, 1973 - infona.pl
A challenging problem in coding theory is the selection of one word from each
nondegenerate equivalence class to form a maximal-size commafree dictionary. The letter …
nondegenerate equivalence class to form a maximal-size commafree dictionary. The letter …
[引用][C] A new binary code of length 10 and covering radius 1
PRJ Ostergard - IEEE transactions on information theory, 1991 - ieeexplore.ieee.org
A new binary code of length 10 and covering radius 1 Page 1 IEEE TRANSACTIONS ON
INFORMATION THEORY, VOL. 37. NO. I. JANUARY IYYI I79 This is the best possible bound; …
INFORMATION THEORY, VOL. 37. NO. I. JANUARY IYYI I79 This is the best possible bound; …