作者: 樹木心 時(shí)間: 2025-3-21 22:04
978-3-540-55130-0Springer-Verlag Berlin Heidelberg 1992作者: exhibit 時(shí)間: 2025-3-22 01:07 作者: cyanosis 時(shí)間: 2025-3-22 06:28 作者: FIG 時(shí)間: 2025-3-22 11:19
Maximal Extractable Value (MEV). are slowly growing functions in the code length .. We show also that constructed codes are comma-free and detect synchronization errors even at high rate of additive errors. To prove these properties of constructed codes, we apply some well-known inequalities for incomplete sums of characters of polynomials.作者: heterogeneous 時(shí)間: 2025-3-22 13:02
Charles Muchunku,Kirsten Ulsrud that . the minimal elements have to be scored. The ordering requires a usually short sorting proceedure applied to the confidence values of the hard-detected bits. In this paper some properties of the minimal elements are derived. We also present bounds on the number of minimal elements with particularly large Hamming weight.作者: JOT 時(shí)間: 2025-3-22 20:11 作者: Meander 時(shí)間: 2025-3-23 01:14
Maximal Extractable Value (MEV). are slowly growing functions in the code length .. We show also that constructed codes are comma-free and detect synchronization errors even at high rate of additive errors. To prove these properties of constructed codes, we apply some well-known inequalities for incomplete sums of characters of p作者: 極深 時(shí)間: 2025-3-23 04:15 作者: aplomb 時(shí)間: 2025-3-23 06:15
Charles Muchunku,Kirsten Ulsrud that . the minimal elements have to be scored. The ordering requires a usually short sorting proceedure applied to the confidence values of the hard-detected bits. In this paper some properties of the minimal elements are derived. We also present bounds on the number of minimal elements with partic作者: INCUR 時(shí)間: 2025-3-23 12:43 作者: 彎彎曲曲 時(shí)間: 2025-3-23 14:52
Blockchain-Plattformen und AbleitungenConstructions of nonbinary linear codes with covering radius . = 2 are considered. Infinite families of linear .-ary codes with . 2, . ≥ 4, and a table of quaternary linear codes with . = 2, redundancy . ≤ 20, are given.作者: Debility 時(shí)間: 2025-3-23 20:11 作者: follicular-unit 時(shí)間: 2025-3-23 23:42 作者: archaeology 時(shí)間: 2025-3-24 05:23
https://doi.org/10.1007/978-3-031-29559-1We present some new lower and upper bounds for the covering radius of codes dual to the product of parity check codes.作者: 諷刺 時(shí)間: 2025-3-24 08:25
https://doi.org/10.1007/978-3-658-39056-3We consider nonbinary codes with growing length and fixed distance. Linear double-error correcting codes over an arbitrary field . with length . = q. and . ? 2(. + 1) + [./3] check symbols are constructed. Codes with greater distances are also studied.作者: 希望 時(shí)間: 2025-3-24 14:39 作者: Dorsal-Kyphosis 時(shí)間: 2025-3-24 16:03 作者: dry-eye 時(shí)間: 2025-3-24 19:32
Our Approach for Cooperative Reasoning,Bounds for the minimum distance and the error probability of decoding for tail biting convolutional codes are presented. We propose a decoding algorithm for these codes and obtain a bound for the asymptotical complexity of almost maximum likelihood decoding.作者: neutrophils 時(shí)間: 2025-3-25 00:11 作者: creatine-kinase 時(shí)間: 2025-3-25 04:34 作者: Engulf 時(shí)間: 2025-3-25 10:18 作者: Filibuster 時(shí)間: 2025-3-25 13:53
Constructions of codes with covering radius 2,Constructions of nonbinary linear codes with covering radius . = 2 are considered. Infinite families of linear .-ary codes with . 2, . ≥ 4, and a table of quaternary linear codes with . = 2, redundancy . ≤ 20, are given.作者: deceive 時(shí)間: 2025-3-25 17:54
On perfect weighted coverings with small radius,We extend the results of our previous paper [8] to the nonlinear case: The Lloyd polynomial of the covering has at least . distinct roots among 1,..., ., where . is the covering radius. We investigate . with diameter 1, finding a partial characterization. We complete an investigation begun in [8] on linear . with distance 1 and diameter 2.作者: Fulminate 時(shí)間: 2025-3-25 23:53 作者: Frequency 時(shí)間: 2025-3-26 03:39
Bounds on covering radius of dual product codes,We present some new lower and upper bounds for the covering radius of codes dual to the product of parity check codes.作者: 無法解釋 時(shí)間: 2025-3-26 07:41 作者: 煤渣 時(shí)間: 2025-3-26 08:32
Saddle point techniques in asymptotic coding theory,We use asymptotic estimates on coefficients of generating functions to derive anew the asymptotic behaviour of the volume of Hamming spheres and Lee spheres for small alphabets. We then derive the asymptotic volume of Lee spheres for large alphabets, and an asymptotic relation between the covering radius and the dual distance of binary codes.作者: Nomadic 時(shí)間: 2025-3-26 13:39 作者: 邊緣 時(shí)間: 2025-3-26 20:39 作者: jumble 時(shí)間: 2025-3-26 22:55
A fast search for the maximum element of the fourier spectrum,An algorithm for determining the index of the maximum spectrum element of the Fourier transform is proposed. Its complexity is linear in the length of the processed sequence. The algorithm leads to the correct decision if the Euclidean distance between the sequence and a basis vector does not exceed √(q/2), where q is the length of the sequence.作者: 物種起源 時(shí)間: 2025-3-27 04:57 作者: Coronation 時(shí)間: 2025-3-27 08:43
Decoding for multiple-access channels,We discuss some results in coding and decoding for multiple-access channels. A new approach to choosing codes and users‘ energies for that channel is described. For the case when a bit error probability and a decoding complexity are fixed we construct a region of achievable code rates.作者: 最小 時(shí)間: 2025-3-27 11:02
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/152557.jpg作者: Delirium 時(shí)間: 2025-3-27 16:57
On the correlation of sequences,at the moduli of certain character sums can be calculated in a very easy way by using a modification of a method of Sidelnikov. These results yield a very simple way to calculate .. for nonbinary sequences found by Kumar and Moreno and for those found by Liu and Komo.作者: esthetician 時(shí)間: 2025-3-27 21:33
Exponential sums and constrained error-correcting codes,. are slowly growing functions in the code length .. We show also that constructed codes are comma-free and detect synchronization errors even at high rate of additive errors. To prove these properties of constructed codes, we apply some well-known inequalities for incomplete sums of characters of polynomials.作者: 致詞 時(shí)間: 2025-3-27 23:35 作者: 步兵 時(shí)間: 2025-3-28 05:32
Conference proceedings 1992 in Leningrad (nowSt. Petersburg) in 1990, was to bring together someof thebest Soviet coding theorists. Scientists from France,Finland, Germany, Israel, Italy, Spain, and the UnitedStates also attended.The papers in the volume fall rather naturally into fourcategories:-Applications of exponential sums- Covering radius- Constructions-Decoding.作者: Charitable 時(shí)間: 2025-3-28 07:37 作者: 纖細(xì) 時(shí)間: 2025-3-28 13:34 作者: violate 時(shí)間: 2025-3-28 18:14 作者: 呼吸 時(shí)間: 2025-3-28 22:21 作者: Nonthreatening 時(shí)間: 2025-3-29 02:18 作者: insipid 時(shí)間: 2025-3-29 06:31 作者: 彩色 時(shí)間: 2025-3-29 07:47
Exponential sums and constrained error-correcting codes,. are slowly growing functions in the code length .. We show also that constructed codes are comma-free and detect synchronization errors even at high rate of additive errors. To prove these properties of constructed codes, we apply some well-known inequalities for incomplete sums of characters of p作者: Formidable 時(shí)間: 2025-3-29 14:41
Position recovery on a circle based on coding theory, in respect to a defined starting position. This can be useful for example for position recovery on a rotating device. Known sequences which can serve this purpose are the de-Bruijn sequences of periodicity 2. or maximal sequences of periodicity 2. ?1. Both such sequences have the property that any 作者: 矛盾 時(shí)間: 2025-3-29 15:33 作者: Albinism 時(shí)間: 2025-3-29 21:42 作者: NAG 時(shí)間: 2025-3-30 01:07
Cheng Huang,Xuemin (Sherman) Shenstructure under which location indices that belong to the same cyclotomic coset are assigned the same value. A new class of binary sequences of periodicity 2. ?1, characterized by the same structure (location indices that belong to the same cyclotomic coset are assigned the same value) is presented 作者: 含鐵 時(shí)間: 2025-3-30 08:04
On Gaussian sums for finite fields and elliptic curves,作者: jagged 時(shí)間: 2025-3-30 08:25 作者: Acumen 時(shí)間: 2025-3-30 15:08 作者: 典型 時(shí)間: 2025-3-30 17:06
8樓作者: 射手座 時(shí)間: 2025-3-31 00:08
8樓作者: omnibus 時(shí)間: 2025-3-31 01:19
8樓作者: 侵害 時(shí)間: 2025-3-31 07:48
9樓作者: 壯麗的去 時(shí)間: 2025-3-31 11:16
9樓作者: 嚴(yán)厲批評(píng) 時(shí)間: 2025-3-31 13:57
9樓作者: 制造 時(shí)間: 2025-3-31 21:26
10樓作者: 共和國 時(shí)間: 2025-4-1 00:05
10樓作者: backdrop 時(shí)間: 2025-4-1 01:52
10樓作者: 復(fù)習(xí) 時(shí)間: 2025-4-1 07:41
10樓
