Optimal binary one-ended codes

被引：1
|
作者：
Kukorelly, Z [1 ]
机构：
[1] Univ Calif San Diego, Informat Coding Lab, La Jolla, CA 92093 USA
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 2002年 / 48卷 / 07期
关键词：
one-ended codes; optimal codes; prefix-free codes; variable-length coding;
D O I：
10.1109/TIT.2002.1013157
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Binary prefix-free codes in which all codewords end with a "1" have been introduced by Berger and Yeung. A recursive method is given here for the construction of all optimal "1"-ended codes with n codewords. It is shown that the set of codes obtained by the construction contains only optimal codes. We also compute recursively the number of essentially different optimal "1"-ended codes with n codewords and show that their number grows faster than any polynomial in n.
引用
收藏
页码：2125 / 2132
页数：8
相关论文
共 50 条
  • [1] The number of optimal binary one-ended codes
    Kukorelly, Z
    2000 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2000, : 14 - 14
  • [2] ONE-ENDED INSERTION OF IS911
    POLARD, P
    SEROUDE, L
    FAYET, O
    PRERE, MF
    CHANDLER, M
    JOURNAL OF BACTERIOLOGY, 1994, 176 (04) : 1192 - 1196
  • [3] MATHEMATICS TEACHING - A ONE-ENDED BRIDGE
    LANG, B
    WINTER, R
    JOURNAL OF CURRICULUM STUDIES, 1983, 15 (04) : 425 - 428
  • [4] One-ended subgroups of mapping class groups
    Bowditch, Brian H.
    HYPERBOLIC GEOMETRY AND GEOMETRIC GROUP THEORY, 2017, 73 : 13 - 36
  • [5] JUNCTION SEQUENCES GENERATED BY ONE-ENDED TRANSPOSITION
    MOTSCH, S
    SCHMITT, R
    AVILA, P
    DELACRUZ, F
    WARD, E
    GRINSTED, J
    NUCLEIC ACIDS RESEARCH, 1985, 13 (09) : 3335 - 3342
  • [6] On tree-decompositions of one-ended graphs
    Carmesin, Johannes
    Lehner, Florian
    Moller, Rognvaldur G.
    MATHEMATISCHE NACHRICHTEN, 2019, 292 (03) : 524 - 539
  • [7] Hamilton decompositions of one-ended Cayley graphs
    Erde, Joshua
    Lehner, Florian
    Pitz, Max
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2020, 140 : 171 - 191
  • [8] ONE-ENDED SPANNING TREES AND DEFINABLE COMBINATORICS
    Bowen, Matt
    Poulin, Antoine
    Zomback, Jenna
    TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 2024, 377 (12) : 8411 - 8431
  • [9] Unimodular random one-ended planar graphs are sofic
    Timar, Adam
    COMBINATORICS PROBABILITY AND COMPUTING, 2023, 32 (06) : 851 - 858
  • [10] Asymptotic geometry of lamplighters over one-ended groups
    Genevois, Anthony
    Tessera, Romain
    INVENTIONES MATHEMATICAE, 2024, 238 (01) : 1 - 67
12345