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

International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications Pub Date : 2004-06-27 DOI:10.1109/ISIT.2004.1365525

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":"56 1","pages":"485"},"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\":\"56 1\",\"pages\":\"485\"},\"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的权重枚举数。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications

自引率

0.00%

发文量