Abstract
The addition and multiplication algorithms of two Hensel codes were presented in two earlier papers [1], [2] on p-adic arithmetic. It is shown here that these algorithms do not always generate a correct result having the same code word length as the two operands and the correct algorithms are given.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
