ON THE SECOND GREEDY WEIGHT FOR LINEARCODES SATISFYING THE FULLRANK CONDITION
文献类型：期刊论文
| 作者 | Chen Wende2; Klove Torleiv1 |
| 刊名 | 系统科学与复杂性：英文版
 |
| 出版日期 | 2005 |
| 卷号 | 18.0期号:1.0页码:55-66 |
| 关键词 | 线性码 界限 二维空间子码 代码字重 贪婪法 |
| ISSN号 | 1009-6124 |
| 其他题名 | ON THE SECOND GREEDY WEIGHT FOR LINEAR CODES SATISFYING THE FULLRANK CONDITION |
| 英文摘要 | 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. |
| 语种 | 中文 |
| CSCD记录号 | CSCD:1875617 |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/55585]  |
| 专题 | 中国科学院数学与系统科学研究院 |
| 作者单位 | 1.挪威卑尔根大学 2.中国科学院数学与系统科学研究院 |
| 推荐引用方式 GB/T 7714 | Chen Wende,Klove Torleiv. ON THE SECOND GREEDY WEIGHT FOR LINEARCODES SATISFYING THE FULLRANK CONDITION[J]. 系统科学与复杂性：英文版,2005,18.0(1.0):55-66. |
| APA | Chen Wende,&Klove Torleiv.(2005).ON THE SECOND GREEDY WEIGHT FOR LINEARCODES SATISFYING THE FULLRANK CONDITION.系统科学与复杂性：英文版,18.0(1.0),55-66. |
| MLA | Chen Wende,et al."ON THE SECOND GREEDY WEIGHT FOR LINEARCODES SATISFYING THE FULLRANK CONDITION".系统科学与复杂性：英文版 18.0.1.0(2005):55-66. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。