Please use this identifier to cite or link to this item:
|Title:||Applications of quasi-uniform codes to storage||Authors:||Thomas, Eldho K.
|Keywords:||DRNTU::Science::Mathematics::Applied mathematics::Signal processing||Issue Date:||2014||Source:||Thomas, E. K. & Oggier, F. (2014). Applications of quasi-uniform codes to storage. 2014 International conference on signal processing and communications (SPCOM), 1-5.||Abstract:||We consider the design of quasi-uniform codes from dihedral 2-groups. Quasi-uniform codes have the distinctive feature of allowing codeword coefficients to live in different alphabets. We obtain a bound on the minimum distance of quasiuniform codes coming from p-groups as a function of the number of p-ary codeword components. We study possible applications of such codes to storage, where the minimum distance is important to allow object retrieval, yet binary coefficients are preferred for fast computations, for example during repairs.||URI:||https://hdl.handle.net/10356/103619
|DOI:||10.1109/SPCOM.2014.6983940||Rights:||© 2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: [http://dx.doi.org/10.1109/SPCOM.2014.6983940].||Fulltext Permission:||open||Fulltext Availability:||With Fulltext|
|Appears in Collections:||SPMS Conference Papers|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.