52维s极值最优非模格的构造

IF 0.9 Q3 COMPUTER SCIENCE, THEORY & METHODS International Journal of Computer Mathematics: Computer Systems Theory Pub Date : 2019-12-05 DOI:10.1080/23799927.2020.1755367
M. Harada
{"title":"52维s极值最优非模格的构造","authors":"M. Harada","doi":"10.1080/23799927.2020.1755367","DOIUrl":null,"url":null,"abstract":"An s-extremal optimal unimodular lattice in dimension 52 is constructed for the first time. This lattice is constructed from a certain self-dual -code by Construction A. In addition, as neighbours of the lattice, two more s-extremal optimal unimodular lattices are constructed.","PeriodicalId":37216,"journal":{"name":"International Journal of Computer Mathematics: Computer Systems Theory","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2019-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Construction of s-extremal optimal unimodular lattices in dimension 52\",\"authors\":\"M. Harada\",\"doi\":\"10.1080/23799927.2020.1755367\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An s-extremal optimal unimodular lattice in dimension 52 is constructed for the first time. This lattice is constructed from a certain self-dual -code by Construction A. In addition, as neighbours of the lattice, two more s-extremal optimal unimodular lattices are constructed.\",\"PeriodicalId\":37216,\"journal\":{\"name\":\"International Journal of Computer Mathematics: Computer Systems Theory\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2019-12-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Computer Mathematics: Computer Systems Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/23799927.2020.1755367\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computer Mathematics: Computer Systems Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/23799927.2020.1755367","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

首次构造了52维的s极值最优单模格。构造a从一个特定的自对偶码构造了这个格。此外,作为格的邻居,构造了另外两个s极值最优非模格。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Construction of s-extremal optimal unimodular lattices in dimension 52
An s-extremal optimal unimodular lattice in dimension 52 is constructed for the first time. This lattice is constructed from a certain self-dual -code by Construction A. In addition, as neighbours of the lattice, two more s-extremal optimal unimodular lattices are constructed.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
International Journal of Computer Mathematics: Computer Systems Theory
International Journal of Computer Mathematics: Computer Systems Theory Computer Science-Computational Theory and Mathematics
CiteScore
1.80
自引率
0.00%
发文量
11
期刊最新文献
On Hendecagonal Circular Ladder and its Metric Dimension Fixed Parameter Tractable Algorithms for Watchman Route Related Problems on Line Segment Arrangements Improved Approximate Dispersion Relation Analysis Using Deep Neural Network A key exchange protocol and a cryptosystem based on the generalized decomposition problem Real iterative algorithms for solving a complex matrix equation with two unknowns
×
引用
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