Maximum flag-rank distance codes

IF 0.9 2区 数学 Q2 MATHEMATICS Journal of Combinatorial Theory Series A Pub Date : 2024-05-20 DOI:10.1016/j.jcta.2024.105908
Gianira N. Alfarano , Alessandro Neri , Ferdinando Zullo
{"title":"Maximum flag-rank distance codes","authors":"Gianira N. Alfarano ,&nbsp;Alessandro Neri ,&nbsp;Ferdinando Zullo","doi":"10.1016/j.jcta.2024.105908","DOIUrl":null,"url":null,"abstract":"<div><p>In this paper we extend the study of linear spaces of upper triangular matrices endowed with the flag-rank metric. Such metric spaces are isometric to certain spaces of degenerate flags and have been suggested as suitable framework for network coding. In this setting we provide a Singleton-like bound which relates the parameters of a flag-rank-metric code. This allows us to introduce the family of maximum flag-rank distance codes, that are flag-rank-metric codes meeting the Singleton-like bound with equality. Finally, we provide several constructions of maximum flag-rank distance codes.</p></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"207 ","pages":"Article 105908"},"PeriodicalIF":0.9000,"publicationDate":"2024-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0097316524000475/pdfft?md5=2c125aba1bc7cdaa56a76a0c7c4abe5d&pid=1-s2.0-S0097316524000475-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Theory Series A","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0097316524000475","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper we extend the study of linear spaces of upper triangular matrices endowed with the flag-rank metric. Such metric spaces are isometric to certain spaces of degenerate flags and have been suggested as suitable framework for network coding. In this setting we provide a Singleton-like bound which relates the parameters of a flag-rank-metric code. This allows us to introduce the family of maximum flag-rank distance codes, that are flag-rank-metric codes meeting the Singleton-like bound with equality. Finally, we provide several constructions of maximum flag-rank distance codes.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
最大旗阶距离编码
在本文中,我们扩展了对赋有旗秩度量的上三角矩阵线性空间的研究。这种度量空间与某些退化旗空间是等距的,并被建议作为网络编码的合适框架。在这种情况下,我们提供了一种类似 Singleton- 的约束,它与旗秩度量编码的参数有关。这样,我们就可以引入最大旗阶距离编码族,即符合辛格列顿类约束的旗阶计量编码。最后,我们提供了几种最大旗阶距离编码的构造。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
2.90
自引率
9.10%
发文量
94
审稿时长
12 months
期刊介绍: The Journal of Combinatorial Theory publishes original mathematical research concerned with theoretical and physical aspects of the study of finite and discrete structures in all branches of science. Series A is concerned primarily with structures, designs, and applications of combinatorics and is a valuable tool for mathematicians and computer scientists.
期刊最新文献
Editorial Board Binary self-orthogonal codes which meet the Griesmer bound or have optimal minimum distances Distribution of maxima and minima statistics on alternating permutations, Springer numbers, and avoidance of flat POPs The geometry of intersecting codes and applications to additive combinatorics and factorization theory Separable elements and splittings in Weyl groups of type B
×
引用
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