发布求助
文献互助 智能选刊 最新文献

International Castle Meeting on Coding Theory and Applications最新文献

筛选
英文 中文
A Coding-Based Approach to Robust Shortest-Path Routing 基于编码的鲁棒最短路径路由方法
International Castle Meeting on Coding Theory and Applications Pub Date : 1900-01-01 DOI: 10.1007/978-3-319-17296-5_3
A. Barbero, Øyvind Ytrehus
{"title":"A Coding-Based Approach to Robust Shortest-Path Routing","authors":"A. Barbero, Øyvind Ytrehus","doi":"10.1007/978-3-319-17296-5_3","DOIUrl":"https://doi.org/10.1007/978-3-319-17296-5_3","url":null,"abstract":"","PeriodicalId":409523,"journal":{"name":"International Castle Meeting on Coding Theory and Applications","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121966142","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The Extension Theorem with Respect to Symmetrized Weight Compositions 关于对称权组合的可拓定理
International Castle Meeting on Coding Theory and Applications Pub Date : 1900-01-01 DOI: 10.1007/978-3-319-17296-5_18
Noha ElGarem, Nefertiti Megahed, Jay A. Wood
{"title":"The Extension Theorem with Respect to Symmetrized Weight Compositions","authors":"Noha ElGarem, Nefertiti Megahed, Jay A. Wood","doi":"10.1007/978-3-319-17296-5_18","DOIUrl":"https://doi.org/10.1007/978-3-319-17296-5_18","url":null,"abstract":"","PeriodicalId":409523,"journal":{"name":"International Castle Meeting on Coding Theory and Applications","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125952970","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
Lattice Encoding of Cyclic Codes from Skew-Polynomial Rings 斜多项式环循环码的格编码
International Castle Meeting on Coding Theory and Applications Pub Date : 1900-01-01 DOI: 10.1007/978-3-319-17296-5_16
Jérôme Ducoat, F. Oggier
{"title":"Lattice Encoding of Cyclic Codes from Skew-Polynomial Rings","authors":"Jérôme Ducoat, F. Oggier","doi":"10.1007/978-3-319-17296-5_16","DOIUrl":"https://doi.org/10.1007/978-3-319-17296-5_16","url":null,"abstract":"","PeriodicalId":409523,"journal":{"name":"International Castle Meeting on Coding Theory and Applications","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116601920","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
Hadamard (mathbb{Z}_{2}mathbb{Z}_{4}Q_{8})-Codes: Rank and Kernel Hadamard (mathbb{Z}_{2}mathbb{Z}_{4}Q_{8}) -代码:秩和内核
International Castle Meeting on Coding Theory and Applications Pub Date : 1900-01-01 DOI: 10.1007/978-3-319-17296-5_29
P. Montolio, J. Rifà
{"title":"Hadamard (mathbb{Z}_{2}mathbb{Z}_{4}Q_{8})-Codes: Rank and Kernel","authors":"P. Montolio, J. Rifà","doi":"10.1007/978-3-319-17296-5_29","DOIUrl":"https://doi.org/10.1007/978-3-319-17296-5_29","url":null,"abstract":"","PeriodicalId":409523,"journal":{"name":"International Castle Meeting on Coding Theory and Applications","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122672423","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On the Automorphism Groups of the (mathbb{Z}_{2}mathbb{Z}_{4})-Linear Hadamard Codes and Their Classification (mathbb{Z}_{2}mathbb{Z}_{4}) -线性Hadamard码的自同构群及其分类
International Castle Meeting on Coding Theory and Applications Pub Date : 1900-01-01 DOI: 10.1007/978-3-319-17296-5_25
D. Krotov, M. Villanueva
{"title":"On the Automorphism Groups of the (mathbb{Z}_{2}mathbb{Z}_{4})-Linear Hadamard Codes and Their Classification","authors":"D. Krotov, M. Villanueva","doi":"10.1007/978-3-319-17296-5_25","DOIUrl":"https://doi.org/10.1007/978-3-319-17296-5_25","url":null,"abstract":"","PeriodicalId":409523,"journal":{"name":"International Castle Meeting on Coding Theory and Applications","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125313299","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Burst Erasure Correction of 2D Convolutional Codes 二维卷积码的突发擦除校正
International Castle Meeting on Coding Theory and Applications Pub Date : 1900-01-01 DOI: 10.1007/978-3-319-17296-5_11
Joan-Josep Climent, D. N. Avelli, R. Pinto, Rita Simões
{"title":"Burst Erasure Correction of 2D Convolutional Codes","authors":"Joan-Josep Climent, D. N. Avelli, R. Pinto, Rita Simões","doi":"10.1007/978-3-319-17296-5_11","DOIUrl":"https://doi.org/10.1007/978-3-319-17296-5_11","url":null,"abstract":"","PeriodicalId":409523,"journal":{"name":"International Castle Meeting on Coding Theory and Applications","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123935074","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Shifted de Bruijn Graphs 改变了de Bruijn的图表
International Castle Meeting on Coding Theory and Applications Pub Date : 1900-01-01 DOI: 10.1007/978-3-319-17296-5_20
Ragnar Freij
{"title":"Shifted de Bruijn Graphs","authors":"Ragnar Freij","doi":"10.1007/978-3-319-17296-5_20","DOIUrl":"https://doi.org/10.1007/978-3-319-17296-5_20","url":null,"abstract":"","PeriodicalId":409523,"journal":{"name":"International Castle Meeting on Coding Theory and Applications","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131292813","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Cyclic Convolutional Codes over Separable Extensions 可分扩展上的循环卷积码
International Castle Meeting on Coding Theory and Applications Pub Date : 1900-01-01 DOI: 10.1007/978-3-319-17296-5_22
J. Gómez-Torrecillas, F. J. Lobillo, G. Navarro
{"title":"Cyclic Convolutional Codes over Separable Extensions","authors":"J. Gómez-Torrecillas, F. J. Lobillo, G. Navarro","doi":"10.1007/978-3-319-17296-5_22","DOIUrl":"https://doi.org/10.1007/978-3-319-17296-5_22","url":null,"abstract":"","PeriodicalId":409523,"journal":{"name":"International Castle Meeting on Coding Theory and Applications","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125114866","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
On Fibre Products of Kummer Curves with Many Rational Points over Finite Fields 有限域上多有理点Kummer曲线的纤维积
International Castle Meeting on Coding Theory and Applications Pub Date : 1900-01-01 DOI: 10.1007/978-3-319-17296-5_33
F. Özbudak, Burcu Gülmez Temur, Oguz Yayla
{"title":"On Fibre Products of Kummer Curves with Many Rational Points over Finite Fields","authors":"F. Özbudak, Burcu Gülmez Temur, Oguz Yayla","doi":"10.1007/978-3-319-17296-5_33","DOIUrl":"https://doi.org/10.1007/978-3-319-17296-5_33","url":null,"abstract":"","PeriodicalId":409523,"journal":{"name":"International Castle Meeting on Coding Theory and Applications","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115239130","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Classification of MDS Codes over Small Alphabets 小字母上MDS代码的分类
International Castle Meeting on Coding Theory and Applications Pub Date : 1900-01-01 DOI: 10.1007/978-3-319-17296-5_24
J. Kokkala, D. Krotov, P. Östergård
{"title":"Classification of MDS Codes over Small Alphabets","authors":"J. Kokkala, D. Krotov, P. Östergård","doi":"10.1007/978-3-319-17296-5_24","DOIUrl":"https://doi.org/10.1007/978-3-319-17296-5_24","url":null,"abstract":"","PeriodicalId":409523,"journal":{"name":"International Castle Meeting on Coding Theory and Applications","volume":"311 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124423494","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信