標(biāo)題: Titlebook: Communications and Cryptography; Two Sides of One Tap Richard E. Blahut,Daniel J. Costello,Thomas Mittel Book 1994 Springer Science+Busines [打印本頁] 作者: JAR 時(shí)間: 2025-3-21 17:41
書目名稱Communications and Cryptography影響因子(影響力)
書目名稱Communications and Cryptography影響因子(影響力)學(xué)科排名
書目名稱Communications and Cryptography網(wǎng)絡(luò)公開度
書目名稱Communications and Cryptography網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Communications and Cryptography被引頻次
書目名稱Communications and Cryptography被引頻次學(xué)科排名
書目名稱Communications and Cryptography年度引用
書目名稱Communications and Cryptography年度引用學(xué)科排名
書目名稱Communications and Cryptography讀者反饋
書目名稱Communications and Cryptography讀者反饋學(xué)科排名
作者: 媒介 時(shí)間: 2025-3-21 23:49
https://doi.org/10.1007/978-3-540-71046-2ificant in that they can be used to construct multipliers for fields large enough for cryptographic systems based on the discrete logarithm problem. Their characteristics also make them ideal candidates for implementing compact, high-speed elliptic curve cryptosystems.作者: 孤僻 時(shí)間: 2025-3-22 01:06
Softwareentwicklung im Offshoringer that there is a leader or a coordinated set of protocols. In this paper, we assume that there is no leader and that the state of the whole scheme is secret from the members; the members do not know the starting time and the originator and their protocols are not coordinated. We consider three new作者: aspect 時(shí)間: 2025-3-22 06:03 作者: 正論 時(shí)間: 2025-3-22 12:11 作者: 業(yè)余愛好者 時(shí)間: 2025-3-22 15:40
https://doi.org/10.1007/978-3-642-55708-8advances in the power-limited environment of scientific space and satellite communication links. The second half of the paper is concerned with progress in the bandwidth-limited environment of commercial satellite and wireline applications. Special attention is paid to contributions made by Massey, 作者: 業(yè)余愛好者 時(shí)間: 2025-3-22 19:56 作者: sorbitol 時(shí)間: 2025-3-23 00:19
https://doi.org/10.1007/978-3-642-56955-5 + 1), where p is a prime and r is a positive integer, introduced by Massey, Costello, and Justesen in 1973. These are repeated-single-root constacyclic codes generated by the polynomial g(x) = (x - a) ., 1 ≤ k < p, a ≠ 0, a ∈ GF(p.). As a by-product of the derivation for the minimum Hamming distanc作者: Platelet 時(shí)間: 2025-3-23 04:58 作者: harrow 時(shí)間: 2025-3-23 08:28
https://doi.org/10.1007/978-3-658-10876-2first time. A recently observed flaw in this proof is noted. Trellises for block codes and lattices are of current interest. An absolutely minimal trellis is exhibited for the E. lattice. This trellis gives a succinct summary of the algebraic, geometrical, and dynamical structure of E. and its subla作者: 提升 時(shí)間: 2025-3-23 12:09
Hans Brandt-Pook,Rainer Kollmeierbase station. We discuss detection and the use of stripping in a multiaccess multipath environment. We finally derive a capacity for these systems. It turns out that CDMA type systems are inherently capable (theoretically) of higher rates than systems such as slow frequency hopping that maintain ort作者: Notorious 時(shí)間: 2025-3-23 16:55
Softwareentwicklung kompakt und verst?ndlich spectral domain and for representing the solutions of recurrence equations used in stream ciphers. So far, finite field Fourier transforms have only been defined on vectors that have a length which is relatively prime to the characteristic of the field. The aim of the paper is to generalize this de作者: 未開化 時(shí)間: 2025-3-23 20:08
Softwareentwicklung kompakt und verst?ndlichues are defined as log-likelihood ratios. The “soft-output”-Viterbi algorithm (SOVA) is described in a compact way, as well as a general rule for “soft-in/soft-out” decoding of binary block codes. An example with a Reed-Muller code in a concatenated scheme shows a coding gain of 3.5 dB at a BER of 1作者: APEX 時(shí)間: 2025-3-23 22:17 作者: Tonometry 時(shí)間: 2025-3-24 05:32
Softwareentwicklung kompakt und verst?ndlichAs a measure of complexity we use the number of comparisons of two digits in the sequence. A straightforward exhaustive search would compare the sequences after having delayed one of them each of the . possible delay values. On the average, two bits are compared before a mismatch is discovered. Henc作者: 織物 時(shí)間: 2025-3-24 10:18
Softwareentwicklung kompakt und verst?ndlichoding matrix is minimal but that there exist minimal encoding matrices that are not canonical. Some equivalent conditions for an encoding matrix to be canonical are given. The generalized constraint lengths are defined. They are invariants of equivalent canonical encoding matrices.作者: 殖民地 時(shí)間: 2025-3-24 13:44
,Arbeitspriorit?ten — ein kleines Beispiel,This paper summarizes the results of four separate research topics related to the generation of binary sequences by linear feedback shift registers for applications in crytographic systems.作者: 聲音刺耳 時(shí)間: 2025-3-24 16:38 作者: 幸福愉悅感 時(shí)間: 2025-3-24 21:04
https://doi.org/10.1007/978-3-642-55708-8An informal survey of certain aspects of coding for a particular multiaccess channel is given. The situation of particular interest is the two-user binary adder channel in which each user transmits a zero or a one and the channel output is the sum, as integers, of the two inputs. The known results in coding for this channel are discussed.作者: Intuitive 時(shí)間: 2025-3-25 03:07 作者: plasma-cells 時(shí)間: 2025-3-25 04:46
Aspects of Linear Complexity,This paper summarizes the results of four separate research topics related to the generation of binary sequences by linear feedback shift registers for applications in crytographic systems.作者: CARK 時(shí)間: 2025-3-25 07:56
,Massey’s Theorem and the Golay Codes,Massey’s theorem is used to determine the minimum distance of the Golay codes. The same method can be used to determine the minimum distance of other cyclic codes. This suggests that Massey’s theorem may be a powerful tool whose uses are not yet fully uncovered.作者: optional 時(shí)間: 2025-3-25 14:13
Coding for Adder Channels,An informal survey of certain aspects of coding for a particular multiaccess channel is given. The situation of particular interest is the two-user binary adder channel in which each user transmits a zero or a one and the channel output is the sum, as integers, of the two inputs. The known results in coding for this channel are discussed.作者: 縱欲 時(shí)間: 2025-3-25 19:05 作者: 想象 時(shí)間: 2025-3-25 22:25 作者: 破譯 時(shí)間: 2025-3-26 01:12 作者: 澄清 時(shí)間: 2025-3-26 06:16 作者: 我悲傷 時(shí)間: 2025-3-26 12:17
https://doi.org/10.1007/978-3-540-71046-2ificant in that they can be used to construct multipliers for fields large enough for cryptographic systems based on the discrete logarithm problem. Their characteristics also make them ideal candidates for implementing compact, high-speed elliptic curve cryptosystems.作者: Agronomy 時(shí)間: 2025-3-26 12:43
,Offshore-Entwicklung im überblick,-dimensional subspace is spanned by precisely one subsequence of length. Because the cyclic sequence has n subsequences of length.n must be the number of d-dimensional subspaces of the m-dimensional binary vector space, which is.This paper solves the case of. 2.作者: Goblet-Cells 時(shí)間: 2025-3-26 19:47
https://doi.org/10.1007/978-3-642-55708-8advances in the power-limited environment of scientific space and satellite communication links. The second half of the paper is concerned with progress in the bandwidth-limited environment of commercial satellite and wireline applications. Special attention is paid to contributions made by Massey, his students, and his co-workers.作者: 行為 時(shí)間: 2025-3-26 21:19
Softwareentwicklung kompakt und verst?ndlichbit lines in .,a finite plane geometry mod ., which have any one of ..-distinct slopes. Minimum distances greater than 2. seem attainable for some sets of . slopes, but 2. is a firm upper bound. A norm on the rationals mod p allows choices of ..-distinct slopes which remain p’-distinct and keep minimum distance for all prime .作者: TSH582 時(shí)間: 2025-3-27 01:21
https://doi.org/10.1007/978-3-658-10876-2first time. A recently observed flaw in this proof is noted. Trellises for block codes and lattices are of current interest. An absolutely minimal trellis is exhibited for the E. lattice. This trellis gives a succinct summary of the algebraic, geometrical, and dynamical structure of E. and its sublattices.作者: Monocle 時(shí)間: 2025-3-27 06:31 作者: 場所 時(shí)間: 2025-3-27 11:31
Softwareentwicklung kompakt und verst?ndlichan be encoded and decoded using convolutional encoders and decoders with slight modifications. The dc-free error-correcting codes are especially well suited for applications in high-speed noisy channels and optical fiber communication systems.作者: 真繁榮 時(shí)間: 2025-3-27 16:59
Softwareentwicklung kompakt und verst?ndlichoding matrix is minimal but that there exist minimal encoding matrices that are not canonical. Some equivalent conditions for an encoding matrix to be canonical are given. The generalized constraint lengths are defined. They are invariants of equivalent canonical encoding matrices.作者: V切開 時(shí)間: 2025-3-27 21:12
Development of Fast Multiplier Structures with Cryptographic Applications,ificant in that they can be used to construct multipliers for fields large enough for cryptographic systems based on the discrete logarithm problem. Their characteristics also make them ideal candidates for implementing compact, high-speed elliptic curve cryptosystems.作者: aviator 時(shí)間: 2025-3-28 01:39
On a Problem of Persi Diaconis,-dimensional subspace is spanned by precisely one subsequence of length. Because the cyclic sequence has n subsequences of length.n must be the number of d-dimensional subspaces of the m-dimensional binary vector space, which is.This paper solves the case of. 2.作者: 消滅 時(shí)間: 2025-3-28 05:04 作者: chalice 時(shí)間: 2025-3-28 07:23
Orthogonal Checksets in the Plane and Enumerations of the Rationals mod ,,bit lines in .,a finite plane geometry mod ., which have any one of ..-distinct slopes. Minimum distances greater than 2. seem attainable for some sets of . slopes, but 2. is a firm upper bound. A norm on the rationals mod p allows choices of ..-distinct slopes which remain p’-distinct and keep minimum distance for all prime .作者: Hot-Flash 時(shí)間: 2025-3-28 12:48
Trellises Old and New,first time. A recently observed flaw in this proof is noted. Trellises for block codes and lattices are of current interest. An absolutely minimal trellis is exhibited for the E. lattice. This trellis gives a succinct summary of the algebraic, geometrical, and dynamical structure of E. and its sublattices.作者: Gleason-score 時(shí)間: 2025-3-28 15:15 作者: Minikin 時(shí)間: 2025-3-28 19:46 作者: inquisitive 時(shí)間: 2025-3-29 02:05 作者: CURL 時(shí)間: 2025-3-29 05:53 作者: 打火石 時(shí)間: 2025-3-29 09:08
Book 1994irectly to significant engineeringpayoffs. Professionally, it is a field that has sustained a remarkabledegree of community, collegiality and high standards. James L. Massey,whose work in the field is honored here, embodies the higheststandards of the profession in his own career. .The book covers t作者: CHIDE 時(shí)間: 2025-3-29 12:08 作者: Canyon 時(shí)間: 2025-3-29 19:27 作者: 合適 時(shí)間: 2025-3-29 22:55 作者: defibrillator 時(shí)間: 2025-3-30 00:40 作者: 傳授知識(shí) 時(shí)間: 2025-3-30 06:26
https://doi.org/10.1007/978-3-642-56955-5ic codes generated by the polynomial g(x) = (x - a) ., 1 ≤ k < p, a ≠ 0, a ∈ GF(p.). As a by-product of the derivation for the minimum Hamming distance these codes are shown to be equivalent to shortened generalized Reed-Solomon codes. An application of these codes is suggested for secret-key cryptosystems.作者: Filibuster 時(shí)間: 2025-3-30 11:18 作者: 假設(shè) 時(shí)間: 2025-3-30 16:14 作者: 熄滅 時(shí)間: 2025-3-30 19:27 作者: avulsion 時(shí)間: 2025-3-30 23:31 作者: hedonic 時(shí)間: 2025-3-31 04:48 作者: 令人心醉 時(shí)間: 2025-3-31 07:50 作者: B-cell 時(shí)間: 2025-3-31 10:11 作者: FAWN 時(shí)間: 2025-3-31 14:40
Softwareentwicklung kompakt und verst?ndliche the exhaustive method requires on the order of 2. binary comparisons before all but one of the possible delay values are eliminated..This paper constructs an algorithm that requires on the order of . comparisons to determine the delay. It was previously known that at least . comparisons are needed on the average before the delay is determined.作者: 衍生 時(shí)間: 2025-3-31 21:19
Using Redundancy to Speed up Disk Arrays, paper shows that scattering redundant blocks throughout the array can provide better average access time statistics. The redundant blocks require significant disk capacity sacrifices and impose a computational burden. However, if current technology trends continue, these costs will be substantially less than the value of improved access times.作者: Afflict 時(shí)間: 2025-4-1 00:52 作者: FOIL 時(shí)間: 2025-4-1 04:57
