Show simple item record

dc.contributor.authorFoldes, Stephan
dc.date.accessioned2013-11-26T10:15:51Z
dc.date.available2013-11-26T10:15:51Z
dc.date.issued2013cs
dc.identifier.citationMathematics for Applications. 2013, 2, č. 1, s. 1-4. ISSN 1805-3629.cs
dc.identifier.issn1805-3629
dc.identifier.urihttp://hdl.handle.net/11012/23992
dc.description.abstractThe 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.en
dc.formattextcs
dc.format.extent1-4cs
dc.format.mimetypeapplication/pdfen
dc.language.isoencs
dc.publisherVysoké učení technické v Brně, Fakulta strojního inženýrství, Ústav matematikycs
dc.relation.ispartofMathematics for Applicationsen
dc.rights© Vysoké učení technické v Brně, Fakulta strojního inženýrství, Ústav matematikycs
dc.titleThe Kraft sum as a monotone function on the refinement-ordered set of uniquely decipherable codescs
eprints.affiliatedInstitution.departmentÚstav matematikycs
eprints.affiliatedInstitution.facultyFakulta strojního inženýrstvícs
dc.coverage.issue1cs
dc.coverage.volume2cs
dc.identifier.doi10.13164/ma.2013.01en
dc.rights.accessopenAccessen
dc.type.driverarticleen
dc.type.statusPeer-revieweden
dc.type.versionpublishedVersionen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record