找回密码
 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-30 09:28:41 | 显示全部楼层
发表于 2025-3-30 15:11:49 | 显示全部楼层
发表于 2025-3-30 16:57:43 | 显示全部楼层
发表于 2025-3-30 21:14:32 | 显示全部楼层
Bounding the Minimum Distance of Affine Variety Codes Using Symbolic Computations of Footprints, 3.2]. Among the codes that we construct almost all have parameters as good as the best known codes according to [.] and in the remaining few cases the parameters are almost as good. To establish the code parameters we apply the footprint bound [., .] from Gröbner basis theory and for this purpose w
发表于 2025-3-31 03:49:48 | 显示全部楼层
发表于 2025-3-31 07:55:07 | 显示全部楼层
发表于 2025-3-31 10:25:42 | 显示全部楼层
发表于 2025-3-31 13:31:22 | 显示全部楼层
发表于 2025-3-31 21:26:12 | 显示全部楼层
Relative Generalized Hamming Weights and Extended Weight Polynomials of Almost Affine Codes,t is how one can express the relative generalized Hamming weights of a pair of codes in terms of intersection properties between the smallest of these codes and subcodes of the largest code. The other result tells how one can find the extended weight polynomials, expressing the number of codewords o
发表于 2025-4-1 01:27:31 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-28 23:12
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表