• čeština
    • English
    • русский
    • Deutsch
    • français
    • polski
    • українська
  • English 
    • čeština
    • English
    • русский
    • Deutsch
    • français
    • polski
    • українська
  • Login
View Item 
  •   Repository Home
  • Časopisy
  • Mathematics for Applications
  • 2013/1
  • View Item
  •   Repository Home
  • Časopisy
  • Mathematics for Applications
  • 2013/1
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

The Kraft sum as a monotone function on the refinement-ordered set of uniquely decipherable codes

Thumbnail
View/Open
01.pdf (998.0Kb)
Date
2013
Author
Foldes, Stephan
Altmetrics
10.13164/ma.2013.01
Metadata
Show full item record
Abstract
The set of all uniquely decipherable (UD) codes is partially ordered by re nement, meaning that all strings in the cruder code can be represented as con- catenations of strings taken from the ner code. The Kraft sum is a monotone (increasing) function on this poset. In the re nement order, chains of UD codes having the same Kraft sum are necessarily of the simple descending type.
Persistent identifier
http://hdl.handle.net/11012/23992
Document type
Peer reviewed
Document version
Final PDF
Source
Mathematics for Applications. 2013, 2, č. 1, s. 1-4. ISSN 1805-3629.
DOI
10.13164/ma.2013.01
Collections
  • 2013/1 [7]
Citace PRO

Portal of libraries | Central library on Facebook
DSpace software copyright © 2002-2015  DuraSpace
Contact Us | Send Feedback | Theme by @mire NV
 

 

Browse

All of repositoryCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

LoginRegister

Statistics

View Usage Statistics

Portal of libraries | Central library on Facebook
DSpace software copyright © 2002-2015  DuraSpace
Contact Us | Send Feedback | Theme by @mire NV