Theoretical foundations for the analytical computation of coefficients of basic numbers of Krestenson's transformation
From MaRDI portal
Publication:2263333
DOI10.1007/S10559-014-9654-0zbMATH Open1342.68033OpenAlexW2040020290WikidataQ57665651 ScholiaQ57665651MaRDI QIDQ2263333FDOQ2263333
Authors: Ya. M. Nikolaĭchuk, M. M. Kasyanchuk, I. Z. Yakimenko
Publication date: 18 March 2015
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-014-9654-0
Recommendations
- Theoretical foundations of the modified perfect form of residue number system
- scientific article; zbMATH DE number 1979683
- Employing the linear transformation and the algebraic complement in numerical systems
- On Translation Algorithms in Residue Number Systems
- Comments on ``The digit parallel method for fast RNS to weighted number system conversion for specific moduli \((2^k -1, 2^k, 2^k +1)\)
Cites Work
Cited In (4)
- Algorithms for solving problems of cryptographic protection of color image pixels in the Rademacher's basis and residue number systems
- Symmetric encryption algorithms in a polynomial residue number system
- Theoretical foundations of the modified perfect form of residue number system
- Employing the linear transformation and the algebraic complement in numerical systems
This page was built for publication: Theoretical foundations for the analytical computation of coefficients of basic numbers of Krestenson's transformation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2263333)