You have Guest access.
Log In
Maria Bras-Amorós and Tom Høholdt
Front matter
1-10
The Order Bound for Toric Codes
11-22
An Extension of the Order Bound for AG Codes
23-31
Sparse Numerical Semigroups
32-42
From the Euclidean Algorithm for Solving a Key Equation for Dual Reed–Solomon Codes to the Berlekamp–Massey Algorithm
43-52
Rank for Some Families of Quaternary Reed-Muller Codes
53-64
Optimal Bipartite Ramanujan Graphs from Balanced Incomplete Block Designs: Their Characterizations and Applications to Expander/LDPC Codes
65-72
Simulation of the Sum-Product Algorithm Using Stratified Sampling
73-82
A Systems Theory Approach to Periodically Time-Varying Convolutional Codes by Means of Their Invariant Equivalent
83-91
On Elliptic Convolutional Goppa Codes
92-100
The Minimum Hamming Distance of Cyclic Codes of Length 2ps
101-106
There Are Not Non-obvious Cyclic Affine-invariant Codes
107-116
On Self-dual Codes over Z16
117-126
A Non-abelian Group Based on Block Upper Triangular Matrices with Cryptographic Applications
127-136
Word Oriented Cascade Jump σ−LFSR
137-148
On Some Sequences of the Secret Pseudo-random Index j in RC4 Key Scheduling
149-158
Very-Efficient Anonymous Password-Authenticated Key Exchange and Its Extensions
159-168
Efficient Constructions of Deterministic Encryption from Hybrid Encryption and Code-Based PKE
169-178
Noisy Interpolation of Multivariate Sparse Polynomials in Finite Fields
179-185
New Commutative Semifields and Their Nuclei
186-194
Spreads in Projective Hjelmslev Geometries
195-203
On the Distribution of Nonlinear Congruential Pseudorandom Numbers of Higher Orders in Residue Rings
204-214
Rooted Trees Searching for Cocyclic Hadamard Matrices over D4t
215-218
Interesting Examples on Maximal Irreducible Goppa Codes
219-222
Repeated Root Cyclic and Negacyclic Codes over Galois Rings
223-226
Construction of Additive Reed-Muller Codes
227-230
Gröbner Representations of Binary Matroids
231-234
A Generalization of the Zig-Zag Graph Product by Means of the Sandwich Product
235-238
Novel Efficient Certificateless Aggregate Signatures
239-242
Bounds on the Number of Users for Random 2-Secure Codes
Back matter
This page requires script.
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info