predict
发表于 2025-3-26 22:47:56
There Are Not Non-obvious Cyclic Affine-invariant CodesWe show that an affine-invariant code . of length .. is not permutation equivalent to a cyclic code except in the obvious cases: . = 1 or . is either {0}, the repetition code or its dual.
Circumscribe
发表于 2025-3-27 03:03:10
Noisy Interpolation of Multivariate Sparse Polynomials in Finite FieldsWe consider the problem of recovering an unknown sparse multivariate polynomial . over a finite field . of prime order . from approximate values of .(..,...,..) at polynomially many points . selected uniformly at random. Our result is based on a combination of bounds on exponential sums with the lattice reduction technique.
逢迎白雪
发表于 2025-3-27 08:39:38
From the Euclidean Algorithm for Solving a Key Equation for Dual Reed–Solomon Codes to the Berlekamprithm, 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-27 11:42:02
http://reply.papertrans.cn/16/1597/159620/159620_34.png
沙草纸
发表于 2025-3-27 13:36:44
http://reply.papertrans.cn/16/1597/159620/159620_35.png
Incompetent
发表于 2025-3-27 20:23:16
On Self-dual Codes over ,,.. 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-27 23:05:48
http://reply.papertrans.cn/16/1597/159620/159620_37.png
acquisition
发表于 2025-3-28 03:48:04
978-3-642-02180-0Springer-Verlag Berlin Heidelberg 2009
aneurysm
发表于 2025-3-28 09:46:10
http://reply.papertrans.cn/16/1597/159620/159620_39.png
STANT
发表于 2025-3-28 13:04:05
http://reply.papertrans.cn/16/1597/159620/159620_40.png