Construction of new codes in term‐rank metric | Zendy

Loc Pham Huu | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Construction of new codes in term‐rank metric

Author(s) -

Loc Pham Huu

Publication year - 2020

Publication title -

iet communications

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.355

H-Index - 62

eISSN - 1751-8636

pISSN - 1751-8628

DOI - 10.1049/iet-com.2019.0709

Subject(s) - term (time) , rank (graph theory) , metric (unit) , mathematics , computer science , combinatorics , physics , operations management , quantum mechanics , economics

This study investigates codes in the term‐rank metric. These codes can be used to correct crisscross errors in a ( M × N ) matrix. These errors can be found in memory chip arrays, in magnetic tape recordings, or in the parallel‐channel system with interference. In this study, the authors will build an algorithm for computing term‐rank of a matrix and new construction of term‐rank codes. Single error‐correcting codes in the term‐rank metric are considered and help us build a generator matrix and parity‐check matrix for term‐rank codes. Research results derived from this study show that the term‐rank metric is suitable for correcting crisscross errors.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research