找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Coding Theory and Applications; 4th International Ca Raquel Pinto,Paula Rocha Malonek,Paolo Vettori Conference proceedings 2015 Springer In

[复制链接]
查看: 25155|回复: 59
发表于 2025-3-21 16:15:45 | 显示全部楼层 |阅读模式
书目名称Coding Theory and Applications
副标题4th International Ca
编辑Raquel Pinto,Paula Rocha Malonek,Paolo Vettori
视频video
丛书名称CIM Series in Mathematical Sciences
图书封面Titlebook: Coding Theory and Applications; 4th International Ca Raquel Pinto,Paula Rocha Malonek,Paolo Vettori Conference proceedings 2015 Springer In
描述.The topics covered in this book, written by researchers at the forefront of their field, represent some of the most relevant research areas in modern coding theory: codes and combinatorial structures, algebraic geometric codes, group codes, quantum codes, convolutional codes, network coding and cryptography..The book includes a survey paper on the interconnections of coding theory with constrained systems, written by an invited speaker, as well as 37 cutting-edge research communications presented at the 4th International Castle Meeting on Coding Theory and Applications (4ICMCTA), held at the Castle of Palmela in September 2014. The event’s scientific program consisted of four invited talks and 39 regular talks by authors from 24 different countries. This conference provided an ideal opportunity for communicating new results, exchanging ideas, strengthening international cooperation, and introducing young researchers into the coding theory community..
出版日期Conference proceedings 2015
关键词algebraic geometric codes; codes and combinatorial structures; convolution codes; group codes; network c
版次1
doihttps://doi.org/10.1007/978-3-319-17296-5
isbn_softcover978-3-319-36552-7
isbn_ebook978-3-319-17296-5Series ISSN 2364-950X Series E-ISSN 2364-9518
issn_series 2364-950X
copyrightSpringer International Publishing Switzerland 2015
The information of publication is updating

书目名称Coding Theory and Applications影响因子(影响力)




书目名称Coding Theory and Applications影响因子(影响力)学科排名




书目名称Coding Theory and Applications网络公开度




书目名称Coding Theory and Applications网络公开度学科排名




书目名称Coding Theory and Applications被引频次




书目名称Coding Theory and Applications被引频次学科排名




书目名称Coding Theory and Applications年度引用




书目名称Coding Theory and Applications年度引用学科排名




书目名称Coding Theory and Applications读者反馈




书目名称Coding Theory and Applications读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 22:57:30 | 显示全部楼层
发表于 2025-3-22 00:40:25 | 显示全部楼层
发表于 2025-3-22 04:35:43 | 显示全部楼层
发表于 2025-3-22 08:55:21 | 显示全部楼层
A Coding-Based Approach to Robust Shortest-Path Routingting algorithms in use in today’s Internet is made up of variations of the so-called . or Bellman-Ford algorithm (Bellman, Quart Appl Math 16:87–90, 1958; Ford (1956) Network flow theory paper P-923. RAND Corporation, Santa Monica; Moore (1959) The shortest path through a maze. In: Proceedings of an
发表于 2025-3-22 16:38:09 | 显示全部楼层
Constructions of Fast-Decodable Distributed Space-Time Codest multiple-output channel, leading to the first fast-decodable distributed space-time codes for more than one antenna per user. Explicit constructions are provided alongside with a performance comparison to non-iterated (non-) fast-decodable codes.
发表于 2025-3-22 19:45:05 | 显示全部楼层
The One-Out-of-k Retrieval Problem and Linear Network Codingnumber of randomly accessed nodes storing one message each. Without network coding, this would require . queries on average. After proving that no scheme can perform better than a straightforward lower bound of 0. 5. average queries, we propose and asymptotically evaluate, using mean field arguments
发表于 2025-3-22 22:21:37 | 显示全部楼层
On the Error-Correcting Radius of Folded Reed–Solomon Code Designsd. Based on this result, an improved construction of FRS codes is motivated, which can be obtained by puncturing Parvaresh–Vardy codes. The proposed codes allow decoding for all rates, remove the structural loss in decoding radius of the original FRS design and maximize the fraction of correctable e
发表于 2025-3-23 01:45:29 | 显示全部楼层
SPC Product Codes over the Erasure Channel of recovering a high number of erasures in some special cases, so the error correcting capability is higher than the minimum distance. In this work, we count the number of possible patterns that are uncorrectable when a number of erasures (up to 8) have occurred.
发表于 2025-3-23 07:32:07 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-26 23:42
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表