標(biāo)題: Titlebook: Cryptography and Coding; 7th IMA Internationa Michael Walker Conference proceedings 1999 Springer-Verlag Berlin Heidelberg 1999 AES.Boolean [打印本頁] 作者: FARCE 時間: 2025-3-21 19:27
書目名稱Cryptography and Coding影響因子(影響力)
書目名稱Cryptography and Coding影響因子(影響力)學(xué)科排名
書目名稱Cryptography and Coding網(wǎng)絡(luò)公開度
書目名稱Cryptography and Coding網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Cryptography and Coding被引頻次
書目名稱Cryptography and Coding被引頻次學(xué)科排名
書目名稱Cryptography and Coding年度引用
書目名稱Cryptography and Coding年度引用學(xué)科排名
書目名稱Cryptography and Coding讀者反饋
書目名稱Cryptography and Coding讀者反饋學(xué)科排名
作者: exceptional 時間: 2025-3-21 21:42
,On Efficient Decoding of Alternant Codes over a Commutative Ring?,Hensel lifting. (It is well-known that a finite local ring, such as a Galois ring, is a Hensel ring.) We characterize the . of monic minimal polynomials of a finite syndrome sequence over a Hensel ring (Theorem 3). It turns out that the monic minimal polynomials coincide modulo the maximal ideal . o作者: 障礙 時間: 2025-3-22 02:45
The Political and Economic Backgroundall document such as a passport or ID card. We show that a step structure is measurably better than the original octal structure used in [.] when there are only a small number of bytes (20 to 30) in the photo-signature.作者: Observe 時間: 2025-3-22 04:43 作者: 小木槌 時間: 2025-3-22 09:05
Some Applications of Bounds for Designs to the Cryptography,esign theory, especially bounding the optimal size of the designs and codes, to cryptography. We give a new bound for the parameter ., when (.)-resilient functions and correlation-immune functions of order . exist. In the last section we present analogous bound for the parameter . of .-wise independent t-resilient function.作者: obsession 時間: 2025-3-22 14:22
A New Method for Generating Sets of Orthogonal Sequences for a Synchronous CDMA System,al sets of a specified length, few have been identified with a structured method of generation such as Walsh codes and orthogonal Gold codes. The application of the new sequences discussed is orthogonal spreading codes in a synchronous code division multiple access (CDMA) system and their correlation properties are considered accordingly.作者: obsession 時間: 2025-3-22 20:08
New Self-Dual Codes over GF(5),ing our method we constructed the following linear self-dual codes over GF(5):(i) [4,2,2], (ii) [8,4,4], (iii) [12,6,6], (iv) [16,8,6], (v) [20,10,8], (vi) [24,12,9], (vii) [28,14,10]. The codes (i), (ii), (iii), (v) are extremal. A [28,14,10] code is constructed here for the first time.作者: Mediocre 時間: 2025-3-22 23:24
Enhanced Image Coding for Noisy Channels,ce and channel coding is shown to correct and restrict errors incurred during transmission over Additive White Gaussian Noise (AWGN) and Rayleigh Fading channels. The error correcting capability of the coding scheme also illustrated with compressed and uncompressed image transmission results which are comparable in terms of their visual quality.作者: Pseudoephedrine 時間: 2025-3-23 02:54 作者: filicide 時間: 2025-3-23 07:03 作者: anchor 時間: 2025-3-23 11:52 作者: Pandemic 時間: 2025-3-23 17:32
The ACFTU, Labor Law, and Labor Reformit level. Trellis construction is based on Wolf’s method[.] and a binary systematic parity check matrix of RS codes is used for bit-level decoding[.]. In simulation results, it is shown that a hybrid of those two permutations can be used for low complexity decoding approaching maximum likelihood performance.作者: Accede 時間: 2025-3-23 20:37
,Combinatorial Structure of Finite Fields with Two Dimensional Modulo Metrics?,wo dimensional metrics and their parameters. We note that some examples of cyclotomic association schemes (which we call M schemes and H schemes respectively) fit properly as weakly metric schemes for these metrics.作者: legislate 時間: 2025-3-24 00:58 作者: Commonplace 時間: 2025-3-24 06:08 作者: 對手 時間: 2025-3-24 07:35
The ACFTU, Labor Law, and Labor Reformesign theory, especially bounding the optimal size of the designs and codes, to cryptography. We give a new bound for the parameter ., when (.)-resilient functions and correlation-immune functions of order . exist. In the last section we present analogous bound for the parameter . of .-wise independent t-resilient function.作者: ADJ 時間: 2025-3-24 11:00 作者: animated 時間: 2025-3-24 17:32
Labor Disputes and International Pressuresing our method we constructed the following linear self-dual codes over GF(5):(i) [4,2,2], (ii) [8,4,4], (iii) [12,6,6], (iv) [16,8,6], (v) [20,10,8], (vi) [24,12,9], (vii) [28,14,10]. The codes (i), (ii), (iii), (v) are extremal. A [28,14,10] code is constructed here for the first time.作者: 變異 時間: 2025-3-24 20:06
Labor Disputes and International Pressuresce and channel coding is shown to correct and restrict errors incurred during transmission over Additive White Gaussian Noise (AWGN) and Rayleigh Fading channels. The error correcting capability of the coding scheme also illustrated with compressed and uncompressed image transmission results which are comparable in terms of their visual quality.作者: 山崩 時間: 2025-3-24 23:51
Labor Disputes and International Pressuresate that the use of majority decoding can enhance the prior techniques in several ways. One enhancement allows the biometric authentication system to leak no information about a user’s biometric when using the proper computational assumptions. Another enhancement is a passive identification system.作者: dysphagia 時間: 2025-3-25 04:48 作者: 聽覺 時間: 2025-3-25 11:07 作者: 蚊子 時間: 2025-3-25 11:44 作者: Feedback 時間: 2025-3-25 19:09 作者: opalescence 時間: 2025-3-25 20:58
The ACFTU, Labor Law, and Labor Reformn codes, secret sharing schemes, correlation-immune and resilient functions. In this paper we give applications of some methods and results from the design theory, especially bounding the optimal size of the designs and codes, to cryptography. We give a new bound for the parameter ., when (.)-resili作者: FLIP 時間: 2025-3-26 03:51
The Political and Economic Background. In this paper we study the tradeoff between two such criteria, the nonlinearity and the resiliency. The results are twofold. Firstly, we establish the maximum nonlinearity for a fixed resiliency in certain cases. Secondly, we present a simple search algorithm for finding Boolean functions with goo作者: 食品室 時間: 2025-3-26 06:46 作者: 乳白光 時間: 2025-3-26 12:02
The Political and Economic Backgroundollection of n sequences, of length n chips, that are mutually orthogonal. Although there are many possible combinations of sequences forming orthogonal sets of a specified length, few have been identified with a structured method of generation such as Walsh codes and orthogonal Gold codes. The appl作者: ovation 時間: 2025-3-26 13:22 作者: 使絕緣 時間: 2025-3-26 18:41
The Political and Economic BackgroundEarth Orbit (LEO) satellite systems is the focus of the paper. The code-division-multiple-access (CDMA) format is emerging as a dominant air interface technology for cellular, personal-communications-services (PCS) as well as satellite installations. This transmission technology relies on a combinat作者: 無瑕疵 時間: 2025-3-27 00:10 作者: 讓步 時間: 2025-3-27 01:40 作者: GROUP 時間: 2025-3-27 08:57 作者: 積習(xí)難改 時間: 2025-3-27 10:46 作者: 燒瓶 時間: 2025-3-27 14:18 作者: 純樸 時間: 2025-3-27 20:44
The Political and Economic Backgroundhold behaviour has been studied in many situations outside coding theory and a number of tools have been developped. One of those turns out to be particularly relevant to coding, namely the derivation of isoperimetric inequalities for product measures on Hamming spaces. we discuss this approach and 作者: vibrant 時間: 2025-3-27 23:57
The Political and Economic Backgroundhe rectangular complement operation. The notions of rectangular closure and basis were already defined. In this paper we represent a method to construct a rectangular basis of a linear code from a given linear basis.作者: Radiculopathy 時間: 2025-3-28 04:04
The Political and Economic Backgroundr block error-control (detection and correction) codes. The representation of codes by means of graphs, and the corresponding graph-based decoding algorithms, are described briefly. Results on the performance of graph decoding methods for block codes of the array and generalised array type will be p作者: 演繹 時間: 2025-3-28 06:30
The Political and Economic Backgroundally efficient algorithm to determine whether or not a time-varying convolutional encoder is catastrophic is derived. This algorithm is shown to be simpler than the catastrophicity test proposed by Balakirsky [.]. Furthermore, the algorithm can easily be generalised to rate . time-varying convolutio作者: Encapsulate 時間: 2025-3-28 14:00 作者: 和平主義者 時間: 2025-3-28 18:27
The ACFTU, Labor Law, and Labor Reform codes. We also define a corresponding key equation and concentrate on decoding alternant codes when . is a domain or a local ring. Our approach is based on minimal realization (MR) of a finite sequence [.,.], which is related to rational approximation and shortest linear recurrences. The resulting 作者: 蕨類 時間: 2025-3-28 19:34 作者: HATCH 時間: 2025-3-28 23:54
The Political and Economic BackgroundDetermining the weight of Boolean functions is of exponential complexity. By using combinatorial results, it is proved that from their algebraic normal form (ANF), it is possible to have polynomial time results on the weight, for some classes of functions. As a result, the structure of the majority functions .. is given.作者: angiography 時間: 2025-3-29 05:14
Applications of Exponential Sums in Communications Theory,We provide an introductory overview of how exponential sums, and bounds for them, have been exploited by coding theorists and communications engineers.作者: diskitis 時間: 2025-3-29 11:06
Designs, Intersecting Families, and Weight of Boolean Functions,Determining the weight of Boolean functions is of exponential complexity. By using combinatorial results, it is proved that from their algebraic normal form (ANF), it is possible to have polynomial time results on the weight, for some classes of functions. As a result, the structure of the majority functions .. is given.作者: LAY 時間: 2025-3-29 14:07 作者: 懶鬼才會衰弱 時間: 2025-3-29 18:01
An Encoding Scheme for Dual Level Access to Broadcasting Networks,irect-sequence spread spectrum communications are implemented to add specific information to the signal within the bandwidth allocated for broadcasting. This is beneficial to both the service providers and all subscribers in the network since the information added can advertise programmes which many are not yet authorised to access.作者: confide 時間: 2025-3-29 23:34
An Overview of the Isoperimetric Method in Coding Theory (Extended Abstract) [Invited Paper],hold behaviour has been studied in many situations outside coding theory and a number of tools have been developped. One of those turns out to be particularly relevant to coding, namely the derivation of isoperimetric inequalities for product measures on Hamming spaces. we discuss this approach and derive consequences.作者: gorgeous 時間: 2025-3-30 02:14
Rectangular Basis of a Linear Code,he rectangular complement operation. The notions of rectangular closure and basis were already defined. In this paper we represent a method to construct a rectangular basis of a linear code from a given linear basis.作者: EXTOL 時間: 2025-3-30 04:29
Catastrophicity Test for Time-Varying Convolutional Encoders,ally efficient algorithm to determine whether or not a time-varying convolutional encoder is catastrophic is derived. This algorithm is shown to be simpler than the catastrophicity test proposed by Balakirsky [.]. Furthermore, the algorithm can easily be generalised to rate . time-varying convolutional encoders.作者: COUCH 時間: 2025-3-30 11:38
Cryptography and Coding978-3-540-46665-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 猛擊 時間: 2025-3-30 13:35 作者: anesthesia 時間: 2025-3-30 18:09
The Political and Economic Background. In this paper we study the tradeoff between two such criteria, the nonlinearity and the resiliency. The results are twofold. Firstly, we establish the maximum nonlinearity for a fixed resiliency in certain cases. Secondly, we present a simple search algorithm for finding Boolean functions with good nonlinearity and some fixed resiliency.作者: promote 時間: 2025-3-30 21:35 作者: Deduct 時間: 2025-3-31 03:52
The Political and Economic Backgroundhold behaviour has been studied in many situations outside coding theory and a number of tools have been developped. One of those turns out to be particularly relevant to coding, namely the derivation of isoperimetric inequalities for product measures on Hamming spaces. we discuss this approach and derive consequences.作者: Synapse 時間: 2025-3-31 05:30
The Political and Economic Backgroundhe rectangular complement operation. The notions of rectangular closure and basis were already defined. In this paper we represent a method to construct a rectangular basis of a linear code from a given linear basis.作者: 雜役 時間: 2025-3-31 10:24
The Political and Economic Backgroundally efficient algorithm to determine whether or not a time-varying convolutional encoder is catastrophic is derived. This algorithm is shown to be simpler than the catastrophicity test proposed by Balakirsky [.]. Furthermore, the algorithm can easily be generalised to rate . time-varying convolutional encoders.作者: ONYM 時間: 2025-3-31 13:37
Michael WalkerIncludes supplementary material: 作者: Heart-Attack 時間: 2025-3-31 20:06 作者: 大洪水 時間: 2025-3-31 22:04
https://doi.org/10.1007/3-540-46665-7AES; Boolean Functions; Coding; Data Encryption; Decoding Algorithms; Error-Correcting Codes; Error-correc作者: Atmosphere 時間: 2025-4-1 02:47 作者: 綠州 時間: 2025-4-1 08:01
Some Applications of Bounds for Designs to the Cryptography,n codes, secret sharing schemes, correlation-immune and resilient functions. In this paper we give applications of some methods and results from the design theory, especially bounding the optimal size of the designs and codes, to cryptography. We give a new bound for the parameter ., when (.)-resili作者: ALE 時間: 2025-4-1 10:49
Further Results on the Relation Between Nonlinearity and Resiliency for Boolean Functions,. In this paper we study the tradeoff between two such criteria, the nonlinearity and the resiliency. The results are twofold. Firstly, we establish the maximum nonlinearity for a fixed resiliency in certain cases. Secondly, we present a simple search algorithm for finding Boolean functions with goo作者: VOK 時間: 2025-4-1 15:46
,Combinatorial Structure of Finite Fields with Two Dimensional Modulo Metrics?,trics) and some group actions defined over them. We follow the well known approach of P. Delsarte [.] to this problem through the construction of association schemes. Association schemes based on this distances are the basic tools we propose to deal with the metric properties of codes defined over t作者: foppish 時間: 2025-4-1 20:15
A New Method for Generating Sets of Orthogonal Sequences for a Synchronous CDMA System,ollection of n sequences, of length n chips, that are mutually orthogonal. Although there are many possible combinations of sequences forming orthogonal sets of a specified length, few have been identified with a structured method of generation such as Walsh codes and orthogonal Gold codes. The appl
