Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. On the 3/4-Conjectur ...
Conference paper

On the 3/4-Conjecture for Fix-Free Codes

Christian Deppe (1), Holger Schnettler (1)
(1) Fakultät für Mathematik = Faculty of Mathematics [Bielefeld]
Download article
Open on HAL
Imported on
May 10, 2017
Published on
December 31, 2004
Last modified on
March 31, 2025
Volume 0
DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)
Proceedings
DOI
10.46298/dmtcs.3431
License
https://about.hal.science/hal-authorisation-v1
Indicators
554
Views
885
Downloads

On the 3/4-Conjecture for Fix-Free Codes

Christian Deppe (1), Holger Schnettler (1)
(1) Fakultät für Mathematik = Faculty of Mathematics [Bielefeld]
Abstract
In this paper we concern ourself with the question, whether there exists a fix-free code for a given sequence of codeword lengths. We focus mostly on results which shows the $\frac{3 }{ 4}$-conjecture for special kinds of lengths sequences.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • Fix-free Codes
  • Kraft inequality
  • $\frac{3 }{ 4}$-conjecture
Cited by

Source: OpenCitations

  • The 3/4 Conjecture for Fix-Free Codes With at Most Three Distinct Codeword Lengths

    IEEE Transactions on Information Theory

    Authors : Spencer Congero ORCID, Kenneth Zeger ORCID

    Journal reference : Volume 69, 2022, pp. 1452-1485

    DOI : 10.1109/tit.2022.3218212

  • Old and New Results on Alphabetic Codes

    arXiv (Cornell University)

    Authors : Roberto Bruno ORCID, Roberto De Prisco ORCID, Ugo Vaccaro ORCID

    Journal reference : Volume , 2025, pp. 151-194

    DOI : 10.1007/978-3-031-82014-4_7
Preview
Loading PDF preview...