Abstract
Permutation codes are widely studied due to their promising applications in flash memories. Based on the theory of permutation groups and subgroups, two classes of permutation codes are constructed to correct a single burst deletion of length up to a designated parameter. The proposed codes can achieve larger rates than available codes while maintaining simple interleaving structures. The decoding methods for the proposed codes are provided in proofs and verified by examples.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
