Genteel
发表于 2025-3-25 07:05:46
A simple description of Kerdock codes,In reference (1).R.D.Baker gives a convenient characterisation of Preparata codes..We here give a proof of his description and a similar one for Kerdock codes.
易发怒
发表于 2025-3-25 08:02:22
Relation between the minimum weight of a linear code over GF(qm) and its q-ary image over GF(q),In this paper we give an upper bound for the minimum distance of the q-ary image of a linear code over GF(q.). This allows us to give some indications about the minimum distance of the q-ary image of MDS codes over GF(q.) when q=2 and q=3.
愤慨点吧
发表于 2025-3-25 12:47:11
http://reply.papertrans.cn/23/2289/228893/228893_23.png
motor-unit
发表于 2025-3-25 16:26:04
Lecture Notes in Earth Sciencesuse the essential difficulty was that of estimating an exponential sum. It looks possible that in some cases this difficulty could be avoided by relating the demands of (8) and (9) to the estimate given by (10). This approach might lead to elementary proofs and at least it improves some bounds for a
知识
发表于 2025-3-25 21:25:08
Swapan Kumar Maity,Ramkrishna Maitithe genus. It has been shown by J.-P. Serre that A(q)≥c logq, where c is a positive constant. His method, based on the existence of infinite towers of Hilbert-class fields, can give better results ; we give here some new lower bounds for A(q) for certain values of q, and we deduce from these some ne
仇恨
发表于 2025-3-26 03:55:22
http://reply.papertrans.cn/23/2289/228893/228893_26.png
ESO
发表于 2025-3-26 05:51:09
https://doi.org/10.1007/978-3-642-68770-9eds to be entrusted to a postman, which is able to modify (to some extent) the order of delivery of the transmitted letters. In this paper, we give a survey of the results obtained to date in the analysis of this . channel and we suggest several generalizations.
lavish
发表于 2025-3-26 08:31:36
http://reply.papertrans.cn/23/2289/228893/228893_28.png
粗糙滥制
发表于 2025-3-26 13:05:13
https://doi.org/10.1007/978-94-009-5986-6hibitive complexity, especially for long codes. This paper is intended to study a suboptimum symbol-by-symbol weighted-output decoding process of block codes derived from the optimum one. Some variability of the computation effort being allowed, it is shown that the average decoding complexity can b
Spinal-Tap
发表于 2025-3-26 20:31:07
https://doi.org/10.1007/978-94-009-5986-6liability of the code symbol is used. We outline relationships between generalized minimum distance and correlation which are two criteria equivalent to Maximum Likelihood Decoding (MLD). A sufficient condition which guarantees the correct result of the GMD decoding algorithm is studied. For high si