{"title":"A new upper bound for codes with a single Hamming distance","authors":"Gábor Hegedüs","doi":"arxiv-2409.07877","DOIUrl":null,"url":null,"abstract":"In this short note we give a new upper bound for the size of a set family\nwith a single Hamming distance. Our proof is an application of the linear algebra bound method.","PeriodicalId":501444,"journal":{"name":"arXiv - MATH - Metric Geometry","volume":"18 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - MATH - Metric Geometry","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.07877","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In this short note we give a new upper bound for the size of a set family
with a single Hamming distance. Our proof is an application of the linear algebra bound method.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
