LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Rate-Improved Permutation Codes for Correcting a Single Burst of Deletions

Photo by julienlphoto from unsplash

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… Click to show full 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.

Keywords: codes correcting; single burst; permutation codes; permutation; improved permutation; rate improved

Journal Title: IEEE Communications Letters
Year Published: 2021

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.