Prefix-Free and Prefix-Correct Complexities with Compound Conditions

被引：0
|
作者：
Kalinina, Elena [1 ]
机构：
[1] Moscow MV Lomonosov State Univ, Dept Mech & Math, Moscow, Russia
来源：
COMPUTER SCIENCE - THEORY AND APPLICATIONS | 2010年 / 6072卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper we compare two types of conditional prefix complexity assuming that conditions are sets of strings rather than strings. We show that prefix-free and prefix-correct versions of the definition are essentially different.
引用
收藏
页码：259 / 265
页数：7
相关论文
共 50 条
  • [31] Multi-Rate Prefix-Free Code Distribution Matching
    Cho, Junho
    Winzer, Peter J.
    2019 OPTICAL FIBER COMMUNICATIONS CONFERENCE AND EXHIBITION (OFC), 2019,
  • [32] Prefix-free languages and initial segments of computably enumerable degrees
    Wu, GH
    COMPUTING AND COMBINATORICS, 2001, 2108 : 576 - 585
  • [33] Rate of Prefix-free Codes in LQG Control Systems with Side Information
    Cuvelier, Travis C.
    Tanaka, Takashi
    2021 55TH ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS (CISS), 2021,
  • [34] Decision Procedure for the Existence of Two-Channel Prefix-Free Codes
    Yin, Hoover H. F.
    Ng, Ka Hei
    Shing, Yu Ting
    Lai, Russell W. F.
    Wang, Xishi
    2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, : 1522 - 1526
  • [35] Not every domain of a plain decompressor contains the domain of a prefix-free one
    Andreev, Mikhail
    Razenshteyn, Ilya
    Shen, Alexander
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (4-5) : 482 - 486
  • [36] On the construction of prefix-free and fix-free codes with specified codeword compositions
    Kakhbod, Ali
    Zadimoghaddam, Morteza
    DISCRETE APPLIED MATHEMATICS, 2011, 159 (18) : 2269 - 2275
  • [37] Simple Worst-Case Optimal Adaptive Prefix-Free Coding
    Gagie, Travis
    DCC 2022: 2022 DATA COMPRESSION CONFERENCE (DCC), 2022, : 453 - 453
  • [38] On the Gap Between Trivial and Nontrivial Initial Segment Prefix-Free Complexity
    Baartse, Martijn
    Barmpalias, George
    THEORY OF COMPUTING SYSTEMS, 2013, 52 (01) : 28 - 47
  • [39] Non-regular Maximal Prefix-Free Subsets of Regular Languages
    Jirasek, Jozef, Jr.
    DEVELOPMENTS IN LANGUAGE THEORY, DLT 2016, 2016, 9840 : 229 - 242
  • [40] Building a pangenome alignment index via recursive prefix-free parsing
    Ferro, Eddie
    Oliva, Marco
    Gagie, Travis
    Boucher, Christina
    ISCIENCE, 2024, 27 (10)
12345