標(biāo)題: Titlebook: Coding Theory and Applications; 5th International Ca ángela I. Barbero,Vitaly Skachek,?yvind Ytrehus Conference proceedings 2017 Springer I [打印本頁] 作者: polysomnography 時間: 2025-3-21 16:49
書目名稱Coding Theory and Applications影響因子(影響力)
書目名稱Coding Theory and Applications影響因子(影響力)學(xué)科排名
書目名稱Coding Theory and Applications網(wǎng)絡(luò)公開度
書目名稱Coding Theory and Applications網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Coding Theory and Applications被引頻次
書目名稱Coding Theory and Applications被引頻次學(xué)科排名
書目名稱Coding Theory and Applications年度引用
書目名稱Coding Theory and Applications年度引用學(xué)科排名
書目名稱Coding Theory and Applications讀者反饋
書目名稱Coding Theory and Applications讀者反饋學(xué)科排名
作者: 建筑師 時間: 2025-3-21 23:59
The Polymorphism Calcite-Aragonite,fy a special class of these decoding networks, which we call transitive networks, and show how they may be used to identify trapping sets and inducing sets. Many codes have transitive decoding network representations. We conclude by investigating the decoding networks of codes arising from product, half-product, and protograph code constructions.作者: 星球的光亮度 時間: 2025-3-22 04:01
https://doi.org/10.1007/978-981-10-7407-3aper we identify those cyclic codes with multidimensional abelian codes and we use the techniques introduced in [.] to construct information sets for first and second order Reed-Muller codes from its defining set.作者: 不自然 時間: 2025-3-22 08:01 作者: 預(yù)測 時間: 2025-3-22 10:37
Lecture Notes in Earth Sciencesparent property. We establish a natural basis for comparing and show that the second approach is stronger than IPP-codes. We also establish a new lower bound on the cardinality of the family of sets with identifiable parent property.作者: DAUNT 時間: 2025-3-22 16:40
Sedimentary and Evolutionary Cyclesmitted signal at arbitrary times, and delays. We present self-synchronizing coding schemes with low latency at the receiver that require no acknowledgement and can decode transmissions subject to random delays and distorted by random glitches.作者: DAUNT 時間: 2025-3-22 17:24
Ulf Bayer,Ewald Altheimer,Walter Deutschlerd code which is the Gray map image of a .-additive code. For ., the kernel of .-linear Hadamard codes can be used for their complete classification. In this paper, the kernel of .-linear Hadamard codes is given for .. However, unlike for ., we show that the dimension of the kernel just allows a partial classification of these Hadamard codes.作者: cathartic 時間: 2025-3-23 01:02
Results of Paleoclimate Studiesertain classes of finite geometries. In particular, we analyze the absorbing set spectra of LDPC codes from finite Euclidean planes. For some parameters, we classify the absorbing sets present and give exact counts on their multiplicities.作者: 瑪瑙 時間: 2025-3-23 04:40
Developments in Settling Studies,ruction to have better error correction performance than the turbo codes with a conventional decoder. Computer simulation has showed a 0.1?dB energy gain relative to the LTE turbo code. Asymptotically the proposed code has distance greater than the product of free distances of component codes.作者: flourish 時間: 2025-3-23 07:48
Developments in Settling Studies,wn. In this paper we present 19 new lower bounds where .. The bounds are based on codes whose automorphisms are prescribed by transitive permutation groups. An exhaustive computer search was carried out to find the new codes.作者: 音樂戲劇 時間: 2025-3-23 09:45 作者: 易于 時間: 2025-3-23 16:40 作者: 啪心兒跳動 時間: 2025-3-23 19:40 作者: 安撫 時間: 2025-3-23 22:31
https://doi.org/10.1007/978-981-10-7407-3aper we identify those cyclic codes with multidimensional abelian codes and we use the techniques introduced in [.] to construct information sets for first and second order Reed-Muller codes from its defining set.作者: AROMA 時間: 2025-3-24 02:21 作者: 破布 時間: 2025-3-24 07:50 作者: probate 時間: 2025-3-24 13:31 作者: 深淵 時間: 2025-3-24 16:16 作者: 隨意 時間: 2025-3-24 20:10
Sedimentary and Evolutionary Cyclesmitted signal at arbitrary times, and delays. We present self-synchronizing coding schemes with low latency at the receiver that require no acknowledgement and can decode transmissions subject to random delays and distorted by random glitches.作者: GIDDY 時間: 2025-3-25 02:20 作者: CYT 時間: 2025-3-25 06:46 作者: 貧困 時間: 2025-3-25 08:54 作者: BARGE 時間: 2025-3-25 13:52
Results of Paleoclimate Studiesure. However, most of the constructions result in either large field sizes and hence too high computational complexity for practical implementation, or in low rates translating into waste of the available storage space..In this paper we address this issue by developing theory towards code existence 作者: 絕食 時間: 2025-3-25 18:33
Results of Paleoclimate Studiesertain classes of finite geometries. In particular, we analyze the absorbing set spectra of LDPC codes from finite Euclidean planes. For some parameters, we classify the absorbing sets present and give exact counts on their multiplicities.作者: INCUR 時間: 2025-3-25 22:43 作者: 樹木中 時間: 2025-3-26 03:00
Results of Paleoclimate Studiesd using a known decomposition of a semisimple group algebra. Consequently, enumeration of such codes are obtained. More explicit formulas are given for the number of quasi-abelian complementary dual codes of index 2 with respect to Euclidean and Hermitian inner products. A sequence of asymptotically作者: ventilate 時間: 2025-3-26 04:31 作者: 青春期 時間: 2025-3-26 08:53 作者: 極小量 時間: 2025-3-26 12:54
Developments in Settling Studies,wn. In this paper we present 19 new lower bounds where .. The bounds are based on codes whose automorphisms are prescribed by transitive permutation groups. An exhaustive computer search was carried out to find the new codes.作者: 不適 時間: 2025-3-26 20:50 作者: 先鋒派 時間: 2025-3-26 21:55 作者: 易于交談 時間: 2025-3-27 03:03 作者: 傾聽 時間: 2025-3-27 09:12
Reed-Muller Codes: Information Sets from Defining Sets,aper we identify those cyclic codes with multidimensional abelian codes and we use the techniques introduced in [.] to construct information sets for first and second order Reed-Muller codes from its defining set.作者: 美食家 時間: 2025-3-27 09:34 作者: 我怕被刺穿 時間: 2025-3-27 13:46 作者: Herbivorous 時間: 2025-3-27 18:43 作者: Mettle 時間: 2025-3-27 23:28
On the Kernel of ,-Linear Hadamard Codes,rd code which is the Gray map image of a .-additive code. For ., the kernel of .-linear Hadamard codes can be used for their complete classification. In this paper, the kernel of .-linear Hadamard codes is given for .. However, unlike for ., we show that the dimension of the kernel just allows a partial classification of these Hadamard codes.作者: Keshan-disease 時間: 2025-3-28 04:47 作者: 蚊子 時間: 2025-3-28 06:33
On the Performance of Block Woven Codes Constructions with Row-Wise Permutations,ruction to have better error correction performance than the turbo codes with a conventional decoder. Computer simulation has showed a 0.1?dB energy gain relative to the LTE turbo code. Asymptotically the proposed code has distance greater than the product of free distances of component codes.作者: ORBIT 時間: 2025-3-28 13:40
New Lower Bounds on Error-Correcting Ternary, Quaternary and Quinary Codes,wn. In this paper we present 19 new lower bounds where .. The bounds are based on codes whose automorphisms are prescribed by transitive permutation groups. An exhaustive computer search was carried out to find the new codes.作者: 心胸狹窄 時間: 2025-3-28 18:04
ángela I. Barbero,Vitaly Skachek,?yvind YtrehusIncludes supplementary material: 作者: 畢業(yè)典禮 時間: 2025-3-28 20:05
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/228890.jpg作者: Meditative 時間: 2025-3-29 02:24 作者: 腫塊 時間: 2025-3-29 04:35 作者: 奴才 時間: 2025-3-29 07:24
Erasure Correction and Locality of Hypergraph Codes,gular hypergraphs based on (.,?.)-regular bipartite graphs. We show that for both the regular and biregular case, when the underlying hypergraph has expansion properties, the guaranteed erasure correcting capability for the resulting codes is improved. We provide bounds on the minimum stopping set s作者: 辯論 時間: 2025-3-29 14:33 作者: BATE 時間: 2025-3-29 18:21 作者: Airtight 時間: 2025-3-29 21:12
Decoding a Perturbed Sequence Generated by an LFSR,o generate the sequence. The situation is different when the sequence is perturbed; for instance, when it is sent through a transmission channel. LFSRs can be described as autonomous systems. A perturbed sequence of bits generated by an LFSR can be interpreted as a codeword in the binary linear code作者: apropos 時間: 2025-3-30 03:11
A Construction of Orbit Codes, as orbits when the action of a subgroup of the general linear group on the set of all subspaces of . is considered. In this paper we present a construction of an Abelian non-cyclic orbit code whose minimum subspace distance is maximal.作者: instill 時間: 2025-3-30 04:10 作者: 浮雕 時間: 2025-3-30 09:28 作者: gregarious 時間: 2025-3-30 15:11 作者: synovial-joint 時間: 2025-3-30 16:57 作者: Detain 時間: 2025-3-30 21:14
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 作者: 替代品 時間: 2025-3-31 07:55 作者: Mhc-Molecule 時間: 2025-3-31 10:25 作者: Perigee 時間: 2025-3-31 13:31 作者: 制定 時間: 2025-3-31 21:26
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作者: Nostalgia 時間: 2025-4-1 01:27 作者: 提升 時間: 2025-4-1 05:16 作者: Limited 時間: 2025-4-1 09:25
Random Network Coding over Composite Fields,n others. In this work, we analyze what can be achieved if different nodes are allowed to use different finite fields from a selection of fields all contained in some composite extension finite field?[., .].作者: 鄙視 時間: 2025-4-1 10:19
0302-9743 es, group codes, convolutional codes, network coding, other applications to communications, and applications of coding theory in cryptography..?.978-3-319-66277-0978-3-319-66278-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 輕浮思想 時間: 2025-4-1 17:34 作者: Maximizer 時間: 2025-4-1 20:23 作者: Nuance 時間: 2025-4-2 01:39
Sediments of Adjacent Seas and Estuariesite fields, we prove that .and then obtain estimations of . for all odd .. The new upper bounds are smaller than the previously known ones. Also, the new bounds hold for all ., not necessary large, whereas the previously best known estimations are proved only for . large enough.
