The Existence of Optimal (v,4,1) Optical Orthogonal Codes Achieving the Johnson Bound

IF 2.9 3区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Transactions on Information Theory Pub Date : 2024-09-11 DOI:10.1109/TIT.2024.3457802
Chenya Zhao;Yanxun Chang;Tao Feng
{"title":"The Existence of Optimal (v,4,1) Optical Orthogonal Codes Achieving the Johnson Bound","authors":"Chenya Zhao;Yanxun Chang;Tao Feng","doi":"10.1109/TIT.2024.3457802","DOIUrl":null,"url":null,"abstract":"Optical orthogonal codes have applications in optical code-division multiple access communication systems. They can also be used to construct protocol sequences for multiuser collision channel without feedback, and constant weight codes for error detection and correction. Direct constructions with explicit codewords are presented to settle the existence of a J-optimal \n<inline-formula> <tex-math>$(v,4,1)$ </tex-math></inline-formula>\n-optical orthogonal code with \n<inline-formula> <tex-math>$\\lfloor (v-1)/12\\rfloor $ </tex-math></inline-formula>\n codewords for any positive integer \n<inline-formula> <tex-math>$v\\neq 25$ </tex-math></inline-formula>\n. As a corollary, it is shown that an optimal \n<inline-formula> <tex-math>$(v,6,4)$ </tex-math></inline-formula>\n-cyclically permutable constant weight code with \n<inline-formula> <tex-math>$\\lfloor (v-1)/12\\rfloor $ </tex-math></inline-formula>\n codewords exists for any positive integer \n<inline-formula> <tex-math>$v\\neq 25$ </tex-math></inline-formula>\n.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"70 12","pages":"8746-8757"},"PeriodicalIF":2.9000,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Information Theory","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10677497/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Optical orthogonal codes have applications in optical code-division multiple access communication systems. They can also be used to construct protocol sequences for multiuser collision channel without feedback, and constant weight codes for error detection and correction. Direct constructions with explicit codewords are presented to settle the existence of a J-optimal $(v,4,1)$ -optical orthogonal code with $\lfloor (v-1)/12\rfloor $ codewords for any positive integer $v\neq 25$ . As a corollary, it is shown that an optimal $(v,6,4)$ -cyclically permutable constant weight code with $\lfloor (v-1)/12\rfloor $ codewords exists for any positive integer $v\neq 25$ .
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
存在实现约翰逊约束的最优 (v, 4, 1) 光学正交码
光正交编码可应用于光码分多址通信系统。它们还可用于构建无反馈多用户碰撞信道的协议序列,以及用于错误检测和纠正的恒权码。本文提出了具有显式码字的直接构造,解决了在任意正整数$v/neq 25$下存在具有$\lfloor (v-1)/12\rfloor $码字的J-最优$(v,4,1)$光正交码的问题。作为推论,对于任意正整数 $vneq 25$,存在一个最优的具有 $lfloor (v-1)/12\rfloor $ 码字的 $(v,6,4)$ 循环可变恒权码。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory 工程技术-工程:电子与电气
CiteScore
5.70
自引率
20.00%
发文量
514
审稿时长
12 months
期刊介绍: The IEEE Transactions on Information Theory is a journal that publishes theoretical and experimental papers concerned with the transmission, processing, and utilization of information. The boundaries of acceptable subject matter are intentionally not sharply delimited. Rather, it is hoped that as the focus of research activity changes, a flexible policy will permit this Transactions to follow suit. Current appropriate topics are best reflected by recent Tables of Contents; they are summarized in the titles of editorial areas that appear on the inside front cover.
期刊最新文献
IEEE Transactions on Information Theory Information for Authors On Minimax Empirical Bayes Predictive Densities TechRxiv: Share Your Preprint Research with the World! IEEE Transactions on Information Theory Information for Authors Adaptive Monotonicity Testing in Sublinear Time
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1