The Kraft sum as a monotone function on the refinement-ordered set of uniquely decipherable codes
| dc.contributor.author | Foldes, Stephan | |
| dc.coverage.issue | 1 | cs |
| dc.coverage.volume | 2 | cs |
| dc.date.accessioned | 2013-11-26T10:15:51Z | |
| dc.date.available | 2013-11-26T10:15:51Z | |
| dc.date.issued | 2013 | cs |
| dc.description.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. | en |
| dc.format | text | cs |
| dc.format.extent | 1-4 | cs |
| dc.format.mimetype | application/pdf | en |
| dc.identifier.citation | Mathematics for Applications. 2013, 2, č. 1, s. 1-4. ISSN 1805-3629. | cs |
| dc.identifier.doi | 10.13164/ma.2013.01 | en |
| dc.identifier.issn | 1805-3629 | |
| dc.identifier.uri | http://hdl.handle.net/11012/23992 | |
| dc.language.iso | en | cs |
| dc.publisher | Vysoké učení technické v Brně, Fakulta strojního inženýrství, Ústav matematiky | cs |
| dc.relation.ispartof | Mathematics for Applications | en |
| dc.rights | © Vysoké učení technické v Brně, Fakulta strojního inženýrství, Ústav matematiky | cs |
| dc.rights.access | openAccess | en |
| dc.title | The Kraft sum as a monotone function on the refinement-ordered set of uniquely decipherable codes | cs |
| dc.type.driver | article | en |
| dc.type.status | Peer-reviewed | en |
| dc.type.version | publishedVersion | en |
| eprints.affiliatedInstitution.department | Ústav matematiky | cs |
| eprints.affiliatedInstitution.faculty | Fakulta strojního inženýrství | cs |