s-Extremal Additive Codes over GF(4)

Evangeline P. Bautista, P. Gaborit, Jon-Lark Kim, Judy L. Walker
{"title":"s-Extremal Additive Codes over GF(4)","authors":"Evangeline P. Bautista, P. Gaborit, Jon-Lark Kim, Judy L. Walker","doi":"10.1109/ISIT.2006.262035","DOIUrl":null,"url":null,"abstract":"Recently Bachoc and Gaborit introduced the notion of s-extremality for binary self-dual codes, generalizing Elkies' study on the highest possible minimum weight of the shadows of binary self-dual codes. In this paper, we introduce a concept of s-extremality for additive self-dual codes over F4, give a bound on the length of these codes with even distance d, classify them up to minimum distance d = 4, give possible lengths (only strongly conjectured for odd d) for which there exist s-extremal codes with 5 les d les 11, and give five s-extremal codes with d = 7 as well as four new s-extremal codes with d = 5. We also describe codes related to s-extremal codes","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2006.262035","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Recently Bachoc and Gaborit introduced the notion of s-extremality for binary self-dual codes, generalizing Elkies' study on the highest possible minimum weight of the shadows of binary self-dual codes. In this paper, we introduce a concept of s-extremality for additive self-dual codes over F4, give a bound on the length of these codes with even distance d, classify them up to minimum distance d = 4, give possible lengths (only strongly conjectured for odd d) for which there exist s-extremal codes with 5 les d les 11, and give five s-extremal codes with d = 7 as well as four new s-extremal codes with d = 5. We also describe codes related to s-extremal codes
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
GF(4)上的s极值加性码
最近Bachoc和Gaborit引入了二进制自对偶码的s-极值概念,推广了Elkies关于二进制自对偶码阴影最大可能最小权值的研究。本文引入了F4上的加性自对偶码的s-极值性概念,给出了这些码的偶数距离d的长度界,并将它们分类到最小距离d = 4,给出了存在5个最小距离d = 11的s-极值码的可能长度(仅对奇数d有强推测),并给出了5个最小距离d = 7的s-极值码和4个新的最小距离d = 5的s-极值码。我们还描述了与s极值码相关的码
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Approximately Lower Triangular Ensembles of LPDC Codes with Linear Encoding Complexity Comparison of Network Coding and Non-Network Coding Schemes for Multi-hop Wireless Networks A New Family of Space-Time Codes for Pulse Amplitude and Position Modulated UWB Systems Constructions of Cooperative Diversity Schemes for Asynchronous Wireless Networks Union Bound Analysis of Bit Interleaved Coded Orthogonal Modulation with Differential Precoding
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1