二元和二次剩余码的权重枚举器

P. Gaborit, Carmen-Simona Nedeloaia, A. Wassermann
{"title":"二元和二次剩余码的权重枚举器","authors":"P. Gaborit, Carmen-Simona Nedeloaia, A. Wassermann","doi":"10.1109/ISIT.2004.1365525","DOIUrl":null,"url":null,"abstract":"We compute the weight enumerators of various quadratic residue (QR) codes over F/sub 2/ and F/sub 3/, together with certain codes of related families like the duadic codes. We use a parallel algorithm to find the number of codewords of a given (not too high) weight, from which we deduce by usual classical methods for selfdual and isodual codes over F/sub 2/ and F/sub 3/ their associated, previously unknown, weight enumerators. We compute weight enumerators for lengths as high as 152 for binary codes (except for n=138 for which one lacks the number of codewords of weight 34) and 84 for ternary codes.","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Weight enumerators of duadic and quadratic residue codes\",\"authors\":\"P. Gaborit, Carmen-Simona Nedeloaia, A. Wassermann\",\"doi\":\"10.1109/ISIT.2004.1365525\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We compute the weight enumerators of various quadratic residue (QR) codes over F/sub 2/ and F/sub 3/, together with certain codes of related families like the duadic codes. We use a parallel algorithm to find the number of codewords of a given (not too high) weight, from which we deduce by usual classical methods for selfdual and isodual codes over F/sub 2/ and F/sub 3/ their associated, previously unknown, weight enumerators. We compute weight enumerators for lengths as high as 152 for binary codes (except for n=138 for which one lacks the number of codewords of weight 34) and 84 for ternary codes.\",\"PeriodicalId\":92224,\"journal\":{\"name\":\"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2004.1365525\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2004.1365525","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

我们计算了F/sub 2/和F/sub 3/上的各种二次剩余码(QR码)的权重枚举数,以及一些相关族的码,如二元码。我们使用并行算法来查找给定(不太高)权重的码字数,从中我们通过通常的经典方法推断F/sub 2/和F/sub 3/其相关的,以前未知的权重枚举数的自对偶和等对偶码。对于二进制代码,我们计算长度高达152的权重枚举数(除了n=138,因为它缺少权重为34的码字数),对于三进制代码,我们计算长度高达84的权重枚举数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Weight enumerators of duadic and quadratic residue codes
We compute the weight enumerators of various quadratic residue (QR) codes over F/sub 2/ and F/sub 3/, together with certain codes of related families like the duadic codes. We use a parallel algorithm to find the number of codewords of a given (not too high) weight, from which we deduce by usual classical methods for selfdual and isodual codes over F/sub 2/ and F/sub 3/ their associated, previously unknown, weight enumerators. We compute weight enumerators for lengths as high as 152 for binary codes (except for n=138 for which one lacks the number of codewords of weight 34) and 84 for ternary codes.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Rank Preserving Code-based Signature Buddhism and the Religious Other Statistical Inference and Exact Saddle Point Approximations Topological structures on DMC spaces A computer-aided investigation on the fundamental limits of caching
×
引用
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