找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Network Coding and Subspace Designs; Marcus Greferath,Mario Osvin Pavčević,María Ángele Book 2018 Springer International Publishing AG 201

[复制链接]
查看: 36071|回复: 41
发表于 2025-3-21 17:15:38 | 显示全部楼层 |阅读模式
书目名称Network Coding and Subspace Designs
编辑Marcus Greferath,Mario Osvin Pavčević,María Ángele
视频video
概述Offers a comprehensive introduction to Network Coding and Designs over GF(q).Provides many mathematical and engineering-type problems.Can be used as a reference textbook for advanced courses on coding
丛书名称Signals and Communication Technology
图书封面Titlebook: Network Coding and Subspace Designs;  Marcus Greferath,Mario Osvin Pavčević,María Ángele Book 2018 Springer International Publishing AG 201
描述.This book, written by experts from universities and major research laboratories, addresses the hot topic of network coding, a powerful scheme for information transmission in networks that yields near-optimal throughput. It introduces readers to this striking new approach to network coding, in which the network is not simply viewed as a mechanism for delivering packets, but rather an algebraic structure named the subspace, which these packets span. This leads to a new kind of coding theory, employing what are called subspace codes. The book presents selected, highly relevant advanced research output on: Subspace Codes and Rank Metric Codes; Finite Geometries and Subspace Designs; Application of Network Coding; Codes for Distributed Storage Systems. The outcomes reflect research conducted within the framework of the European COST Action IC1104: .Random Network Coding and Designs over GF(q).. Taken together, they offer communications engineers, R&D engineers, researchers and graduate students in Mathematics, Computer Science, and Electrical Engineering a comprehensive reference guide to the construction of optimal network codes, as well as efficient encoding and decoding schemes for
出版日期Book 2018
关键词Optimal Network Codes; Distributed Storage; Grassmannian Codes; Encoding / Decoding Schemes; Cryptosyste
版次1
doihttps://doi.org/10.1007/978-3-319-70293-3
isbn_softcover978-3-319-88917-7
isbn_ebook978-3-319-70293-3Series ISSN 1860-4862 Series E-ISSN 1860-4870
issn_series 1860-4862
copyrightSpringer International Publishing AG 2018
The information of publication is updating

书目名称Network Coding and Subspace Designs影响因子(影响力)




书目名称Network Coding and Subspace Designs影响因子(影响力)学科排名




书目名称Network Coding and Subspace Designs网络公开度




书目名称Network Coding and Subspace Designs网络公开度学科排名




书目名称Network Coding and Subspace Designs被引频次




书目名称Network Coding and Subspace Designs被引频次学科排名




书目名称Network Coding and Subspace Designs年度引用




书目名称Network Coding and Subspace Designs年度引用学科排名




书目名称Network Coding and Subspace Designs读者反馈




书目名称Network Coding and Subspace Designs读者反馈学科排名




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

1票 100.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 20:24:45 | 显示全部楼层
1860-4862 used as a reference textbook for advanced courses on coding.This book, written by experts from universities and major research laboratories, addresses the hot topic of network coding, a powerful scheme for information transmission in networks that yields near-optimal throughput. It introduces reade
发表于 2025-3-22 02:35:09 | 显示全部楼层
Generalizing Subspace Codes to Flag Codes Using Group Actionsization, where we replace subspace codes with flag codes. We describe and analyze a channel model for these new codes that is similar to the operator channel introduced by Koetter and Kschischang, give examples of flag codes and discuss how to compute sphere packing and sphere covering bounds for flag codes.
发表于 2025-3-22 06:54:12 | 显示全部楼层
Constructions of Cyclic Subspace Codes and Maximum Rank Distance Codesnear maps that these polynomials represent. All known constructions of maximum rank distance codes in the literature are summarized using this linearized polynomial representation. Connections among the constructions and further explanations are also provided.
发表于 2025-3-22 12:18:30 | 显示全部楼层
发表于 2025-3-22 14:49:50 | 显示全部楼层
发表于 2025-3-22 17:02:27 | 显示全部楼层
Constructions of Constant Dimension Codesmetric, in particular those matrices whose non-zero entries constitute certain Ferrers diagrams. A large part of the survey is then concerned with orbit codes, i.e., subsets of the Grassmannian that can be expressed as the orbit under an action of an algebraic group. Finally we review several constr
发表于 2025-3-22 22:18:05 | 显示全部楼层
Multi-shot Network Codingent shots can improve the error-correction capabilities. A very natural way to impose correlation of codewords(subspaces) over time is by means of convolutional codes, originating the notion of rank metric convolutional codes. In this Chapter we review some of the main results and ideas of multi-sho
发表于 2025-3-23 03:52:56 | 显示全部楼层
-Analogs of Designs: Subspace Designsamilies, intersection numbers, and automorphisms of subspace designs. In addition, .-Steiner systems and so called large sets of subspace designs will be covered. Finally, this survey aims to be a comprehensive source for all presently known subspace designs and large sets of subspace designs with s
发表于 2025-3-23 07:19:35 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-16 04:35
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表