New bounds on the minimum distance of cyclic codes
Two bounds on the minimum distance of cyclic codes are proposed. The first one generalizes the Roos bound by embedding the given cyclic code into a cyclic product code. The second bound also uses a second cyclic code, namely the non-zero-locator code, but is not directly related to cyclic product co...
Saved in:
| Main Authors: | , |
|---|---|
| 其他作者: | |
| 格式: | Article |
| 語言: | English |
| 出版: |
2021
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/146495 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| id |
sg-ntu-dr.10356-146495 |
|---|---|
| record_format |
dspace |
| spelling |
sg-ntu-dr.10356-1464952021-02-22T05:09:12Z New bounds on the minimum distance of cyclic codes Ling, San Özkaya, Buket School of Physical and Mathematical Sciences Science::Mathematics::Applied mathematics::Information theory Cyclic Codes Product Code Two bounds on the minimum distance of cyclic codes are proposed. The first one generalizes the Roos bound by embedding the given cyclic code into a cyclic product code. The second bound also uses a second cyclic code, namely the non-zero-locator code, but is not directly related to cyclic product codes and it generalizes a special case of the Roos bound. 2021-02-22T05:06:32Z 2021-02-22T05:06:32Z 2021 Journal Article Ling, S., & Özkaya, B. (2021). New bounds on the minimum distance of cyclic codes. Advances in Mathematics of Communications, 15(1). doi:10.3934/amc.2020038 1930-5338 https://hdl.handle.net/10356/146495 10.3934/amc.2020038 2-s2.0-85099400681 1 15 en Advances in Mathematics of Communications © 2021 American Institute of Mathematical Sciences (AIMS). All rights reserved. |
| institution |
Nanyang Technological University |
| building |
NTU Library |
| continent |
Asia |
| country |
Singapore Singapore |
| content_provider |
NTU Library |
| collection |
DR-NTU |
| language |
English |
| topic |
Science::Mathematics::Applied mathematics::Information theory Cyclic Codes Product Code |
| spellingShingle |
Science::Mathematics::Applied mathematics::Information theory Cyclic Codes Product Code Ling, San Özkaya, Buket New bounds on the minimum distance of cyclic codes |
| description |
Two bounds on the minimum distance of cyclic codes are proposed. The first one generalizes the Roos bound by embedding the given cyclic code into a cyclic product code. The second bound also uses a second cyclic code, namely the non-zero-locator code, but is not directly related to cyclic product codes and it generalizes a special case of the Roos bound. |
| author2 |
School of Physical and Mathematical Sciences |
| author_facet |
School of Physical and Mathematical Sciences Ling, San Özkaya, Buket |
| format |
Article |
| author |
Ling, San Özkaya, Buket |
| author_sort |
Ling, San |
| title |
New bounds on the minimum distance of cyclic codes |
| title_short |
New bounds on the minimum distance of cyclic codes |
| title_full |
New bounds on the minimum distance of cyclic codes |
| title_fullStr |
New bounds on the minimum distance of cyclic codes |
| title_full_unstemmed |
New bounds on the minimum distance of cyclic codes |
| title_sort |
new bounds on the minimum distance of cyclic codes |
| publishDate |
2021 |
| url |
https://hdl.handle.net/10356/146495 |
| _version_ |
1695706178419425280 |