一阶Reed-Muller码的排列译码新进展

Finite Fields Their Appl. Pub Date : 2023-02-10 DOI:10.48550/arXiv.2302.05189

J. J. Bernal, J. J. Sim'on

{"title":"一阶Reed-Muller码的排列译码新进展","authors":"J. J. Bernal, J. J. Sim'on","doi":"10.48550/arXiv.2302.05189","DOIUrl":null,"url":null,"abstract":"In this paper we describe a variation of the classical permutation decoding algorithm that can be applied to any affine-invariant code with respect to certain type of information sets. In particular, we can apply it to the family of first-order Reed-Muller codes with respect to the information sets introduced in [2]. Using this algortihm we improve considerably the number of errors we can correct in comparison with the known results in this topic.","PeriodicalId":156673,"journal":{"name":"Finite Fields Their Appl.","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"New advances in permutation decoding of first-order Reed-Muller codes\",\"authors\":\"J. J. Bernal, J. J. Sim'on\",\"doi\":\"10.48550/arXiv.2302.05189\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we describe a variation of the classical permutation decoding algorithm that can be applied to any affine-invariant code with respect to certain type of information sets. In particular, we can apply it to the family of first-order Reed-Muller codes with respect to the information sets introduced in [2]. Using this algortihm we improve considerably the number of errors we can correct in comparison with the known results in this topic.\",\"PeriodicalId\":156673,\"journal\":{\"name\":\"Finite Fields Their Appl.\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-02-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Finite Fields Their Appl.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.48550/arXiv.2302.05189\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Finite Fields Their Appl.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.48550/arXiv.2302.05189","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文描述了经典排列译码算法的一种变体，它可以应用于任意类型信息集的仿射不变码。特别地，我们可以将它应用于关于[2]中引入的信息集的一阶Reed-Muller码族。使用此算法，与本主题的已知结果相比，我们可以大大提高我们可以纠正的错误数量。

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

查看原文本刊更多论文

New advances in permutation decoding of first-order Reed-Muller codes

In this paper we describe a variation of the classical permutation decoding algorithm that can be applied to any affine-invariant code with respect to certain type of information sets. In particular, we can apply it to the family of first-order Reed-Muller codes with respect to the information sets introduced in [2]. Using this algortihm we improve considerably the number of errors we can correct in comparison with the known results in this topic.

求助全文

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

来源期刊

Finite Fields Their Appl.

自引率

0.00%

发文量