[PDF] Top 20 Codes from algebraic number fields
Has 10000 "Codes from algebraic number fields" found on our website. Below are the top 20 most common "Codes from algebraic number fields".
Codes from algebraic number fields
... The new codes are the analogues, for number fields, of the codes constructed by Goppa and Tsfasman [7, 12] from curves over fimte fields For the analogy between number fields and curves [r] ... See full document
10
Algebraic divisibility sequences over function fields
... We conclude our introduction with a brief overview of the contents of this paper. In Section 2 we motivate our work with some historical remarks on the study of primes and primitive divisors in divisibility sequences. ... See full document
28
The genetic code, algebraic codes and double numbers
... The idea about special mathematical peculiarities of living matter exists long ago. For example V.I. Vernadsky [Vernadsky, 1965] put forward the hypothesis on a non-Euclidean geometry of living nature. Different branches ... See full document
28
DoubleMod and SingleMod: Simple Randomized Secret-Key Encryption with Bounded Homomorphicity
... alternative algebraic settings (e.g., non-Euclidean number fields) for the purpose of finding an alternative setting in which it might have significantly higher levels of cryptographic ... See full document
24
On p adic estimates of weights in Abelian codes over Galois rings
... In this chapter, we review the fundamental mathematics needed to state and prove our results. We also introduce definitions, notations, and combinatorial devices that allow us to describe and manipulate the objects that ... See full document
231
Leakage-resilient Algebraic Manipulation Detection Codes with Optimal Parameters
... the number of shares a is between r and t, then an a−t r−t fraction of the secret is ...the number of shares are at most t + bρ(r − t)c, the probability of being able to reconstruct the secret is upper ... See full document
14
Algebraic divisibility sequences over function fields
... a number field, then these valuations correspond to divisors defined over K , and thus are attached to a Galois orbit of ...follows from [39, Theorem ... See full document
29
Jitman
... the algebraic structure of 1-generator quasi-abelian codes is given in Section 3 together with an algorithm to find all 1-generator quasi-abelian codes and the number of such ...new ... See full document
12
On linear algebraic groups over pseudoglobal fields
... linear algebraic groups over an algebraic function field K in one variable with a pseudofinite [5] constant field ...natural number n, and if every absolutely irreducible affine variety defined over k has ... See full document
12
On divisible codes over finite fields
... linear codes that exhibits nontrivial divisibility such that all codeword weights have a common divisor greater than ...Such codes are named by Harold ...certain number of times. Besides, several ... See full document
71
Relative integral basis for algebraic number fields
... RELATIVE INTEGRAL BASIS FOR ALGEBRAIC NUMBER FIELDS MOHMOOD HAGHIGHI Department of Computer Science Bradley University Peoria, Illinois 61625 U.S.Ao Received January 23, 1985 and in revi[r] ... See full document
8
Integral Sequences of Infinite Length Whose Terms Are Relatively Prime
... (resp. p) for all posi- tive integers m and n with if v is not congruent modulo p to 1 (resp. if v is congruent modulo p to 1). Our first proof of Theorem 2 uses Elementary Number The- ory. Our second proof of ... See full document
5
Contributions to algebraic number theory from India: From independence to late 90's
... There has been several contributions from mathematicians at Chandigarh on Henselian rings. The classical result of Hasse and Arf on higher ramification groups in a cyclic Galois extension of a complete discrete ... See full document
15
Arithmetic Teichmuller Theory
... the algebraic fundamen- tal group which are associated to hyperbolic smooth curves defined over number-fields encode all the arithmetic information of these ...coming from all curves of the ... See full document
15
Constructing Small-Bias Sets from Algebraic-Geometric Codes
... the number of evaluation points (which is bounded by the number of degree one places N(F)) is at most O(g √ q) when N(F) ...ε-balanced codes of dimension k and ... See full document
20
Computing in Algebraic Closures of Finite Fields
... finite fields has found much attention during recent decades, most notably due to developments in the branches of computer science such as cryptography, coding theory, switch- ing circuits, and combinatorics [ 18 ... See full document
86
Units in families of totally complex algebraic number fields
... Multidimensional continued fraction algorithms associated with GL n (Z K ), where Z k is the ring of integers of an imaginary quadratic field K, are introduced and applied to find systems of fundamental units in families ... See full document
18
Diffusion Matrices from Algebraic-Geometry Codes with Efficient SIMD Implementation
... finite fields as a linear mapping in block cipher design is an old trend, followed by many prominent algorithms such as the AES / Rijndael family ...derived from maximum distance separable linear ... See full document
18
Diophantine equations and identities
... Some new third and fifth degree combinatorial identities are derived from units in algebraic number fields... KEY WORDS AND PHRASES..[r] ... See full document
23
Euclidean number fields 2
... The ring R is said to be euclidean with respect to the norm, or, more briefly, norm-euclidean if for every pair of elements α and ß of R, with β Φ 0, it is possible to find a quotient κ.[r] ... See full document
5
Related subjects