找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Coding Theory and Applications; 5th International Ca Ángela I. Barbero,Vitaly Skachek,Øyvind Ytrehus Conference proceedings 2017 Springer I

[复制链接]
楼主: polysomnography
发表于 2025-3-28 18:04:29 | 显示全部楼层
Ángela I. Barbero,Vitaly Skachek,Øyvind YtrehusIncludes supplementary material:
发表于 2025-3-28 20:05:07 | 显示全部楼层
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/228890.jpg
发表于 2025-3-29 02:24:49 | 显示全部楼层
发表于 2025-3-29 04:35:11 | 显示全部楼层
发表于 2025-3-29 07:24:39 | 显示全部楼层
Erasure Correction and Locality of Hypergraph Codes,gular hypergraphs based on (., .)-regular bipartite graphs. We show that for both the regular and biregular case, when the underlying hypergraph has expansion properties, the guaranteed erasure correcting capability for the resulting codes is improved. We provide bounds on the minimum stopping set s
发表于 2025-3-29 14:33:24 | 显示全部楼层
发表于 2025-3-29 18:21:15 | 显示全部楼层
发表于 2025-3-29 21:12:51 | 显示全部楼层
Decoding a Perturbed Sequence Generated by an LFSR,o generate the sequence. The situation is different when the sequence is perturbed; for instance, when it is sent through a transmission channel. LFSRs can be described as autonomous systems. A perturbed sequence of bits generated by an LFSR can be interpreted as a codeword in the binary linear code
发表于 2025-3-30 03:11:51 | 显示全部楼层
A Construction of Orbit Codes, as orbits when the action of a subgroup of the general linear group on the set of all subspaces of . is considered. In this paper we present a construction of an Abelian non-cyclic orbit code whose minimum subspace distance is maximal.
发表于 2025-3-30 04:10:29 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-28 23:06
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表