On the codewords of generalized Reed-Muller codes reaching the fourth weight

IF 0.8 4区 计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS Information and Computation Pub Date : 2023-11-13 DOI:10.1016/j.ic.2023.105113
Somayyeh Golalizadeh, Nasrin Soltankhah
{"title":"On the codewords of generalized Reed-Muller codes reaching the fourth weight","authors":"Somayyeh Golalizadeh,&nbsp;Nasrin Soltankhah","doi":"10.1016/j.ic.2023.105113","DOIUrl":null,"url":null,"abstract":"<div><p>Recently, the fourth weight of generalized Reed-Muller codes <span><math><msub><mrow><mi>R</mi></mrow><mrow><mi>q</mi></mrow></msub><mo>(</mo><mi>a</mi><mo>(</mo><mi>q</mi><mo>−</mo><mn>1</mn><mo>)</mo><mo>+</mo><mi>b</mi><mo>,</mo><mi>m</mi><mo>)</mo></math></span> have been characterized for <span><math><mn>3</mn><mo>≤</mo><mi>b</mi><mo>&lt;</mo><mfrac><mrow><mi>q</mi><mo>+</mo><mn>4</mn></mrow><mrow><mn>3</mn></mrow></mfrac></math></span> and <span><math><mn>0</mn><mo>≤</mo><mi>a</mi><mo>≤</mo><mi>m</mi><mo>−</mo><mn>3</mn></math></span>. In this paper, we study the codewords reaching the fourth weight of generalized Reed-Muller codes. We will determine the fourth weight codewords of generalized Reed-Muller codes of order <span><math><mi>r</mi><mo>=</mo><mi>a</mi><mo>(</mo><mi>q</mi><mo>−</mo><mn>1</mn><mo>)</mo><mo>+</mo><mi>b</mi></math></span> with <span><math><mn>3</mn><mo>≤</mo><mi>b</mi><mo>&lt;</mo><mfrac><mrow><mi>q</mi><mo>+</mo><mn>4</mn></mrow><mrow><mn>3</mn></mrow></mfrac></math></span> and <span><math><mn>0</mn><mo>≤</mo><mi>a</mi><mo>≤</mo><mi>m</mi><mo>−</mo><mn>3</mn></math></span>. Also, we characterize the number of fourth weight codewords of <span><math><msub><mrow><mi>R</mi></mrow><mrow><mi>q</mi></mrow></msub><mo>(</mo><mi>b</mi><mo>,</mo><mi>m</mi><mo>)</mo></math></span> for <span><math><mn>3</mn><mo>≤</mo><mi>b</mi><mo>&lt;</mo><mfrac><mrow><mi>q</mi><mo>+</mo><mn>4</mn></mrow><mrow><mn>3</mn></mrow></mfrac></math></span>.</p></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"296 ","pages":"Article 105113"},"PeriodicalIF":0.8000,"publicationDate":"2023-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information and Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0890540123001165","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

Recently, the fourth weight of generalized Reed-Muller codes Rq(a(q1)+b,m) have been characterized for 3b<q+43 and 0am3. In this paper, we study the codewords reaching the fourth weight of generalized Reed-Muller codes. We will determine the fourth weight codewords of generalized Reed-Muller codes of order r=a(q1)+b with 3b<q+43 and 0am3. Also, we characterize the number of fourth weight codewords of Rq(b,m) for 3b<q+43.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
广义Reed-Muller码的码字达到第四权值
最近,在文献[5]中刻画了广义Reed-Muller码Rq(a(q−1)+b,m)的第四权为3≤b
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Information and Computation
Information and Computation 工程技术-计算机:理论方法
CiteScore
2.30
自引率
0.00%
发文量
119
审稿时长
140 days
期刊介绍: Information and Computation welcomes original papers in all areas of theoretical computer science and computational applications of information theory. Survey articles of exceptional quality will also be considered. Particularly welcome are papers contributing new results in active theoretical areas such as -Biological computation and computational biology- Computational complexity- Computer theorem-proving- Concurrency and distributed process theory- Cryptographic theory- Data base theory- Decision problems in logic- Design and analysis of algorithms- Discrete optimization and mathematical programming- Inductive inference and learning theory- Logic & constraint programming- Program verification & model checking- Probabilistic & Quantum computation- Semantics of programming languages- Symbolic computation, lambda calculus, and rewriting systems- Types and typechecking
期刊最新文献
An algebraic attack on the key exchange protocol based upon a modified tropical structure Distributed fractional local ratio and independent set approximation Editorial Board Editorial Board A parallel algorithm for counting parse trees
×
引用
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