標題: Titlebook: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes; 13th International S Marc Fossorier,Hideki Imai,Alain Poli Conference pro [打印本頁] 作者: Traction 時間: 2025-3-21 17:23
書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes影響因子(影響力)
書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes影響因子(影響力)學科排名
書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes網(wǎng)絡公開度
書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes網(wǎng)絡公開度學科排名
書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes被引頻次
書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes被引頻次學科排名
書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes年度引用
書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes年度引用學科排名
書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes讀者反饋
書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes讀者反饋學科排名
作者: Temporal-Lobe 時間: 2025-3-21 21:15 作者: 分開如此和諧 時間: 2025-3-22 03:08 作者: 從容 時間: 2025-3-22 06:12 作者: ear-canal 時間: 2025-3-22 10:34
https://doi.org/10.1007/978-1-4684-2214-6very such isomorphism ., a so-called discrete Fourier transform of ?., consists of a full set of pairwise inequivalent irreducible representations D. of ?.. A result of Morgenstern combined with the well-known Schur relations in representation theory show that (under mild conditions) any straight li作者: Tremor 時間: 2025-3-22 14:39
James W. Shearer,William C. Conditce in soft-decision iterative decoding algorithms for binary block codes used over the AWGN channel using BPSK signaling. Then the derivation of such sufficient conditions and the selection of centers of search regions in iterative steps are formulated uniformly as a type of integer programming prob作者: 廚房里面 時間: 2025-3-22 21:06 作者: 正論 時間: 2025-3-23 00:35 作者: 交響樂 時間: 2025-3-23 03:14
https://doi.org/10.1007/978-81-322-2337-5nsider the problem of computing the nearest lattice point in ... They developed and later improved [.] an algorithm which is able to compute a nearest point in .(..) arithmetic steps. In this paper, a new algorithm is developed which is able to compute a nearest point in . steps.作者: 蒸發(fā) 時間: 2025-3-23 06:34 作者: Density 時間: 2025-3-23 12:43 作者: AXIS 時間: 2025-3-23 14:15 作者: 強行引入 時間: 2025-3-23 19:38 作者: 圍裙 時間: 2025-3-23 23:06
Adedayo J. Ogungbile,Ayodeji E. Oke (TCM) is proposed. The concept of a bootstrap decoding is introduced first and then the new metric functions which take into account the bootstrap iterative decoding algorithm for TCM systems are derived. One and two dimensional bootstrap decoding are proposed for packet transmission. Furthermore, 作者: 變態(tài) 時間: 2025-3-24 04:10
J. Benford,H. Calvin,I. Smith,H. AslinThe use of curves in algebraic geometries in applications such as coding and cryptography is now extensive. This note reviews recent developments in the construction of such curves and their application to these subjects.作者: Paleontology 時間: 2025-3-24 07:48 作者: 拍下盜公款 時間: 2025-3-24 12:26
Anil Kumar,Geetam Richhariya,Atul SharmaWe study a representation of Boolean functions (and more generally of integer-valued / complex-valued functions), not used until now in coding and cryptography,which yields more information than the currently known representations,on the combinatorial, spectral and cryptographic properties of the functions.作者: 反省 時間: 2025-3-24 17:44 作者: defibrillator 時間: 2025-3-24 21:08 作者: Indecisive 時間: 2025-3-25 00:07 作者: placebo-effect 時間: 2025-3-25 06:57 作者: 攝取 時間: 2025-3-25 07:52 作者: 平常 時間: 2025-3-25 13:42 作者: 上漲 時間: 2025-3-25 16:00
On the Size of Identifying CodesA code is called .-identifying if the sets ..(x) ∩ . are all nonempty and different. Constructions of 1-identifying codes and lower bounds on the minimum cardinality of a 1-identifying code of length . are given.作者: FLORA 時間: 2025-3-25 20:09 作者: debouch 時間: 2025-3-26 03:08
Some Results on Generalized Concatenation of Block CodesWe consider generalized concatenation of block codes. First we give a short introduction on the notion for concatenated and errorlocating codes. Then an estimation of the hard decision error correcting capacity of concatenated codes beyond half the minimum distance is presented.作者: 灌溉 時間: 2025-3-26 06:26 作者: 本土 時間: 2025-3-26 10:37
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/159627.jpg作者: 確保 時間: 2025-3-26 14:03
https://doi.org/10.1007/3-540-46796-3Algebraic Algorithms; Algebraic Codes; Algebraic Curves; Block Codes; Combinatorial Computations; Cryptog作者: affluent 時間: 2025-3-26 17:16
978-3-540-66723-0Springer-Verlag Berlin Heidelberg 1999作者: 招致 時間: 2025-3-27 00:59 作者: iodides 時間: 2025-3-27 03:28 作者: Recessive 時間: 2025-3-27 07:47
Energy Sustainability Through Green Energyansmit over an erasure channel at rates arbitrarily close to the channel capacity. We also show that these codes are close to optimal with respect to the trade-off between the proximity to the channel capacity and the running time of the recovery algorithm.作者: 開花期女 時間: 2025-3-27 12:20
Renu Singh,Arti Bhatia,Monika Srivastavapaper we present a new type of discrepancy bound for sequences of s-tuples of successive nonlinear multiple recursive congruential pseudorandom numbers of higher orders. In particular, we generalize some recent results about recursive congruential pseudorandom numbers of first order.作者: phlegm 時間: 2025-3-27 17:12 作者: 寄生蟲 時間: 2025-3-27 20:45 作者: harbinger 時間: 2025-3-28 01:08
Han Phoumin,Fukunari Kimura,Jun Arimathe smallest size of the support of a 2-dimensional subcode of . which contains a codeword of weight d. For codes of dimension 4, the maximal value of ..-. is determined. For general dimensions, upper and lower bounds on the maximal value are given.作者: Obstreperous 時間: 2025-3-28 06:10 作者: Conspiracy 時間: 2025-3-28 08:28
New Sequences of Linear Time Erasure Codes Approaching the Channel Capacityansmit over an erasure channel at rates arbitrarily close to the channel capacity. We also show that these codes are close to optimal with respect to the trade-off between the proximity to the channel capacity and the running time of the recovery algorithm.作者: Ondines-curse 時間: 2025-3-28 13:30
On the Distribution of Nonlinear Recursive Congruential Pseudorandom Numbers of Higher Orderspaper we present a new type of discrepancy bound for sequences of s-tuples of successive nonlinear multiple recursive congruential pseudorandom numbers of higher orders. In particular, we generalize some recent results about recursive congruential pseudorandom numbers of first order.作者: extemporaneous 時間: 2025-3-28 16:15
An Algorithm to Compute a Nearest Point in the Lattice , ,nsider the problem of computing the nearest lattice point in ... They developed and later improved [.] an algorithm which is able to compute a nearest point in .(..) arithmetic steps. In this paper, a new algorithm is developed which is able to compute a nearest point in . steps.作者: mastopexy 時間: 2025-3-28 21:53 作者: 青春期 時間: 2025-3-28 23:31
On the Second Greedy Weight for Binary Linear Codesthe smallest size of the support of a 2-dimensional subcode of . which contains a codeword of weight d. For codes of dimension 4, the maximal value of ..-. is determined. For general dimensions, upper and lower bounds on the maximal value are given.作者: MAIM 時間: 2025-3-29 04:14 作者: Intellectual 時間: 2025-3-29 09:32 作者: 健忘癥 時間: 2025-3-29 15:28
Near Optimal Decoding for TCM Using the BIVA and Trellis Shapingthe trellis shaping technique is also considered to combine with such TCM schemes using the BIVA. The simulation results show that the performance of 1.25 dB away from Shannon limit can be achieved by the BIVA and trellis shaping for 256-state 6 bits/. TCM scheme, with low complexity and reasonable computation.作者: ABASH 時間: 2025-3-29 18:27
Conference proceedings 1999atrices, block codes, rings and fields, decoding methods, code construction, algebraic curves, cryptography, codes and decoding, convolutional codes, designs, decoding of block codes, modulation and codes, Gr?bner bases and AG codes, and polynomials.作者: 業(yè)余愛好者 時間: 2025-3-29 23:23 作者: Spirometry 時間: 2025-3-30 01:34
B. P. Da?browski,P. Rudawy,M. Karlickyiting realizations are inherently normal. Efficient realizations of Reed-Muller codes are presented. Low-density parity-check codes use generic parity-check realizations. Algebraic tools may improve such graph-based codes.作者: 假裝是你 時間: 2025-3-30 08:04 作者: 四目在模仿 時間: 2025-3-30 11:32 作者: 單挑 時間: 2025-3-30 15:52 作者: Herd-Immunity 時間: 2025-3-30 17:09 作者: 歡笑 時間: 2025-3-30 22:42
On ?4-Simplex Codes and Their Gray Images like 2-dimension, Hamming and Lee weight distributions, weight hierarchy etc. are determined for these codes. It is shown that binary images of .. and .. by the Gray map give rise to some interesting binary codes.作者: 知道 時間: 2025-3-31 03:42 作者: HARD 時間: 2025-3-31 05:52
https://doi.org/10.1007/978-1-4684-2214-6.) FFT of ?.. The running time to construct . is essentially proportional to the time to write down all the monomial (!) twiddle factors ..(..) where the gi are the generators corresponding to the pc-presentation. Finally, we sketch some applications.作者: COLIC 時間: 2025-3-31 12:42
A Fast Program Generator of Fast Fourier Transforms.) FFT of ?.. The running time to construct . is essentially proportional to the time to write down all the monomial (!) twiddle factors ..(..) where the gi are the generators corresponding to the pc-presentation. Finally, we sketch some applications.作者: 貝雷帽 時間: 2025-3-31 13:48 作者: 圍巾 時間: 2025-3-31 17:48 作者: dainty 時間: 2025-3-31 23:28 作者: Prosaic 時間: 2025-4-1 05:29 作者: 洞察力 時間: 2025-4-1 07:15 作者: 壓倒性勝利 時間: 2025-4-1 14:04
RA Codes Achieve AWGN Channel Capacityto decode using an iterative decoding algorithm derived from belief propagation on the appropriate Tanner graph, yet their performance is scarcely inferior to that of full-fledged turbo codes. In this paper, we prove that on the AWGN channel, RA codes have the potential for achieving channel capacit作者: 修飾語 時間: 2025-4-1 15:24 作者: 種族被根除 時間: 2025-4-1 19:48
A Fast Program Generator of Fast Fourier Transformsvery such isomorphism ., a so-called discrete Fourier transform of ?., consists of a full set of pairwise inequivalent irreducible representations D. of ?.. A result of Morgenstern combined with the well-known Schur relations in representation theory show that (under mild conditions) any straight li作者: Lumbar-Spine 時間: 2025-4-1 22:39
On Integer Programming Problems Related to Soft-Decision Iterative Decoding Algorithmsce in soft-decision iterative decoding algorithms for binary block codes used over the AWGN channel using BPSK signaling. Then the derivation of such sufficient conditions and the selection of centers of search regions in iterative steps are formulated uniformly as a type of integer programming prob
