Zobrazit minimální záznam



dc.contributor.authorLegerský , Jan
dc.date.accessioned2018-12-04T14:40:24Z
dc.date.available2018-12-04T14:40:24Z
dc.date.issued2018
dc.identifier.citationActa Polytechnica. 2018, vol. 58, no. 5, p. 285-291.
dc.identifier.issn1210-2709 (print)
dc.identifier.issn1805-2363 (online)
dc.identifier.urihttp://hdl.handle.net/10467/79124
dc.description.abstractParallel addition, i.e., addition with limited carry propagation has been so far studied for complex bases and integer alphabets. We focus on alphabets consisting of integer combinations of powers of the base. We give necessary conditions on the alphabet allowing parallel addition. Under certain assumptions, we prove the same lower bound on the size of the generalized alphabet that is known for alphabets consisting of consecutive integers. We also extend the characterization of bases allowing parallel addition to numeration systems with non-integer alphabets.en
dc.format.mimetypeapplication/pdf
dc.language.isoeng
dc.publisherČeské vysoké učení technické v Prazecs
dc.publisherCzech Technical University in Pragueen
dc.relation.ispartofseriesActa Polytechnica
dc.relation.urihttps://ojs.cvut.cz/ojs/index.php/ap/article/view/4699
dc.rightsCreative Commons Attribution 4.0 International Licenseen
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/
dc.subjectnumeration system, parallel addition, minimal alphabeten
dc.titleMINIMAL NON-INTEGER ALPHABETS ALLOWING PARALLEL ADDITION
dc.typearticleen
dc.date.updated2018-12-04T14:40:25Z
dc.identifier.doi10.14311/AP.2018.58.0285
dc.rights.accessopenAccess
dc.type.statusPeer-reviewed
dc.type.versionpublishedVersion


Soubory tohoto záznamu



Tento záznam se objevuje v následujících kolekcích

Zobrazit minimální záznam

Creative Commons Attribution 4.0 International License
Kromě případů, kde je uvedeno jinak, licence tohoto záznamu je Creative Commons Attribution 4.0 International License