onthesecondgreedyweightforlinearcodessatisfyingthefullrankcondition
文献类型：期刊论文
| 作者 | Chen Wende1; Klove Torleiv2 |
| 刊名 | journalofsystemsscienceandcomplexity
 |
| 出版日期 | 2005 |
| 卷号 | 018期号:001页码:55 |
| ISSN号 | 1009-6124 |
| 英文摘要 | The maximum of g2-d2 for linear n, k, d; q codes C is studied. Here d2 is the smallest size of the support of 2-dimensional subcodes of C and g2 is the smallest size of the support of 2-dimensional subcodes of C which contains a codeword of weight d. The extra cost to the greedy adversary to get two symbols of information using some algorithm is g2-d2. For codes satisfying the fullrank condition of general dimensions, upper bounds on the maximum of g2-d2 are given. Under some condition we have got code C where g2-d2 reaches the upper bound. |
| 语种 | 英语 |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/39370]  |
| 专题 | 中国科学院数学与系统科学研究院 |
| 作者单位 | 1.中国科学院数学与系统科学研究院 2.卑尔根大学 |
| 推荐引用方式 GB/T 7714 | Chen Wende,Klove Torleiv. onthesecondgreedyweightforlinearcodessatisfyingthefullrankcondition[J]. journalofsystemsscienceandcomplexity,2005,018(001):55. |
| APA | Chen Wende,&Klove Torleiv.(2005).onthesecondgreedyweightforlinearcodessatisfyingthefullrankcondition.journalofsystemsscienceandcomplexity,018(001),55. |
| MLA | Chen Wende,et al."onthesecondgreedyweightforlinearcodessatisfyingthefullrankcondition".journalofsystemsscienceandcomplexity 018.001(2005):55. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。