找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes; 18th International S Maria Bras-Amorós,Tom Høholdt Conference proceedings

[复制链接]
楼主: deliberate
发表于 2025-3-30 08:15:07 | 显示全部楼层
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes978-3-642-02181-7Series ISSN 0302-9743 Series E-ISSN 1611-3349
发表于 2025-3-30 15:18:11 | 显示全部楼层
https://doi.org/10.1007/978-90-481-2383-4rithm, both designed to solve a key equation. This article presents a new version of the key equation and a way to use the Euclidean algorithm to solve it. A straightforward reorganization of the algorithm yields the Berlekamp-Massey algorithm.
发表于 2025-3-30 17:27:27 | 显示全部楼层
https://doi.org/10.1007/978-90-481-2383-4s and properties as the codes in the usual binary linear Reed-Muller family have been introduced. A structural invariant, the rank, for binary codes is used to classify some of these ℤ.-linear codes. The rank is established generalizing the known results about the rank for ℤ.-linear Hadamard and ℤ.-linear extended 1-perfect codes.
发表于 2025-3-31 00:38:26 | 显示全部楼层
https://doi.org/10.1007/978-90-481-2383-4f the BIBD graphs and show that they yield optimal expander graphs that are also bipartite Ramanujan graphs. In particular, we show that the bipartite graphs derived from finite projective and affine geometries yield optimal Ramanujan graphs. This in turn leads to a theoretical explanation of the good performance of a class of LDPC codes.
发表于 2025-3-31 01:14:07 | 显示全部楼层
Sakib Bin Amin,Saanjaana Rahman.. and give a necessary and sufficient condition for the self-duality of induced codes. We then give an inductive algorithm for constructing all self-dual codes over .., and establish the mass formula, which counts the number of such codes.
发表于 2025-3-31 05:56:00 | 显示全部楼层
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/159620.jpg
发表于 2025-3-31 09:48:54 | 显示全部楼层
An Extension of the Order Bound for AG Codesng-Rao bound. By using a finer partition of the set of all codewords of a code we improve the order bounds by Beelen and by Duursma and Park. We show that the new bound can be efficiently optimized and we include a numerical comparison of different bounds for all two-point codes with Goppa distance
发表于 2025-3-31 16:08:41 | 显示全部楼层
发表于 2025-3-31 20:00:42 | 显示全部楼层
发表于 2025-4-1 01:07:15 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-14 20:01
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表