Abstract
The search for perfect codes is a classic problem in coding theory. Perfect codes in Hamming distance were studied extensively and a characterization was obtained for the class of such codes. This paper considers perfect codes in Rank distance. A partial answer to the question whether a perfect rank distance code exists is obtained using a straight forward computation method.
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 callMore From: Journal of Discrete Mathematical Sciences and Cryptography
Disclaimer: 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.
