扩展代码的最小距离界限

Vitaly Skachek
{"title":"扩展代码的最小距离界限","authors":"Vitaly Skachek","doi":"10.1109/ITA.2008.4601075","DOIUrl":null,"url":null,"abstract":"Several expander code constructions and their parameters are surveyed. New generalized expander codes are introduced and their properties are compared with the properties of the existing constructions. Finally, some possible directions to extend the current research on expander codes are discussed.","PeriodicalId":345196,"journal":{"name":"2008 Information Theory and Applications Workshop","volume":"63 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Minimum distance bounds for expander codes\",\"authors\":\"Vitaly Skachek\",\"doi\":\"10.1109/ITA.2008.4601075\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Several expander code constructions and their parameters are surveyed. New generalized expander codes are introduced and their properties are compared with the properties of the existing constructions. Finally, some possible directions to extend the current research on expander codes are discussed.\",\"PeriodicalId\":345196,\"journal\":{\"name\":\"2008 Information Theory and Applications Workshop\",\"volume\":\"63 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-08-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 Information Theory and Applications Workshop\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITA.2008.4601075\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Information Theory and Applications Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITA.2008.4601075","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

介绍了几种扩展器代码结构及其参数。介绍了新的广义扩展码,并与现有结构的性能进行了比较。最后讨论了扩展码研究的一些可能的发展方向。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Minimum distance bounds for expander codes
Several expander code constructions and their parameters are surveyed. New generalized expander codes are introduced and their properties are compared with the properties of the existing constructions. Finally, some possible directions to extend the current research on expander codes are discussed.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Cellular systems with multicell processing and conferencing links between mobile stations On resource allocation in two-way limited feedback beamforming systems Can the storage capacity of memories built from unreliable components be determined? The application of distributed spectrum sensing and available resource maps to cognitive radio systems Feedback schemes for multiuser MIMO-OFDM downlink
×
引用
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