Applications of quasi-uniform codes to storage

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...

全面介紹

Saved in:
書目詳細資料
Main Authors: Thomas, Eldho K., Oggier, Frédérique
其他作者: School of Physical and Mathematical Sciences
格式: Conference or Workshop Item
語言:English
出版: 2015
主題:
在線閱讀:https://hdl.handle.net/10356/103619
http://hdl.handle.net/10220/24617
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: Nanyang Technological University
語言: English
id sg-ntu-dr.10356-103619
record_format dspace
spelling sg-ntu-dr.10356-1036192023-02-28T19:17:53Z Applications of quasi-uniform codes to storage Thomas, Eldho K. Oggier, Frédérique School of Physical and Mathematical Sciences 2014 International Conference on Signal Processing and Communications (SPCOM) DRNTU::Science::Mathematics::Applied mathematics::Signal processing 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. Accepted version 2015-01-14T09:26:04Z 2019-12-06T21:16:26Z 2015-01-14T09:26:04Z 2019-12-06T21:16:26Z 2014 2014 Conference Paper Thomas, E. K. & Oggier, F. (2014). Applications of quasi-uniform codes to storage. 2014 International conference on signal processing and communications (SPCOM), 1-5. https://hdl.handle.net/10356/103619 http://hdl.handle.net/10220/24617 10.1109/SPCOM.2014.6983940 178652 en © 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]. application/pdf
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic DRNTU::Science::Mathematics::Applied mathematics::Signal processing
spellingShingle DRNTU::Science::Mathematics::Applied mathematics::Signal processing
Thomas, Eldho K.
Oggier, Frédérique
Applications of quasi-uniform codes to storage
description 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.
author2 School of Physical and Mathematical Sciences
author_facet School of Physical and Mathematical Sciences
Thomas, Eldho K.
Oggier, Frédérique
format Conference or Workshop Item
author Thomas, Eldho K.
Oggier, Frédérique
author_sort Thomas, Eldho K.
title Applications of quasi-uniform codes to storage
title_short Applications of quasi-uniform codes to storage
title_full Applications of quasi-uniform codes to storage
title_fullStr Applications of quasi-uniform codes to storage
title_full_unstemmed Applications of quasi-uniform codes to storage
title_sort applications of quasi-uniform codes to storage
publishDate 2015
url https://hdl.handle.net/10356/103619
http://hdl.handle.net/10220/24617
_version_ 1759857193378643968