Designs, Codes and Cryptography, Volume 66 (original) (raw)



default search action
- combined dblp search
- author search
- venue search
- publication search
Authors:
- no matches

Venues:
- no matches

Publications:
- no matches



SPARQL queries 
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Volume 66, Numbers 1-3, January 2013
Special Issue on Coding and Cryptography

Daniel Augot, Anne Canteaut, Gohar M. Kyureghyan, Faina I. Solov'eva, Øyvind Ytrehus:
Editorial. 1-2

Eimear Byrne, Marcus Greferath, Jaume Pernas, Jens Zumbrägel:
Algebraic decoding of negacyclic codes over {\mathbb Z_4}$$. 3-16

Patrick Solé, Jean-Claude Belfiore:
Constructive spherical codes near the Shannon bound. 17-26

Thomas Honold, Ivan N. Landjev:
Non-free extensions of the simplex codes over a chain ring with four elements. 27-38

Michael Kiermaier, Johannes Zwanzger:
New ring-linear codes from dualization in projective Hjelmslev geometries. 39-55

Antonia Wachter-Zeh, Valentin B. Afanassiev
, Vladimir Sidorenko
:
Fast decoding of Gabidulin codes. 57-73

Andrey Bogdanov
, Kyoji Shibutani:
Generalized Feistel networks revisited. 75-97

Alexander Pott, Yue Zhou
:
CCZ and EA equivalence between mappings over finite Abelian groups. 99-109

Ernst Schulte-Geers:
On CCZ-equivalence of addition mod 2 n. 111-127

Leonid A. Bassalygo, Victor A. Zinoviev:
On divisibility of exponential sums of polynomials of special type over fields of characteristic 2. 129-143

Marcus Greferath, Cathy Mc Fadden, Jens Zumbrägel:
Characteristics of invariant weights related to code equivalence over rings. 145-156

Santanu Sarkar
, Subhamoy Maitra:
Cryptanalytic results on 'Dual CRT' and 'Common Prime' RSA. 157-174

Andrea Röck, Kaisa Nyberg
:
Generalization of Matsui's Algorithm 1 to linear hull for key-alternating block ciphers. 175-193

Olav Geil
, Casper Thomsen:
Weighted Reed-Muller codes revisited. 195-220

Peter Beelen
, Diego Ruano
:
Bounding the number of points on a curve using a generalization of Weierstrass semigroups. 221-230

Ayça Çesmelioglu
, Wilfried Meidl:
A construction of bent functions from plateaued functions. 231-242

Sugata Gangopadhyay, Anand B. Joshi
, Gregor Leander
, Rajendra Kumar Sharma:
A new construction of bent functions based on {\mathbb{Z}}$$ -bent functions. 243-256

Wilfried Meidl, Alev Topuzoglu:
Quadratic functions with prescribed spectra. 257-273

Joachim Rosenthal
, Anna-Lena Trautmann
:
A complete characterization of irreducible cyclic orbit codes and their Plücker embedding. 275-289

Alain Couvreur, Iwan M. Duursma:
Evaluation codes from smooth quadric surfaces and twisted Segre varieties. 291-303

Lars Eirik Danielsen
, Matthew Geoffrey Parker:
The selfnegadual properties of generalised quadratic Boolean functions. 305-316

Irene Marquez Corbella
, Edgar Martínez-Moro
, Ruud Pellikaan:
The non-gap sequence of a subcode of a generalized Reed-Solomon code. 317-333

Sanjay Bhattacherjee
, Palash Sarkar:
Complete tree subset difference broadcast encryption scheme and its analysis. 335-362

I. M. Boyarinov:
Three-dimensional cyclic Fire codes. 363-373

Annika Meyer:
On the number of lattice points in a small sphere and a recursive lattice decoding algorithm. 375-390

Sergey Bezzateev
, Natalia A. Shekhunova:
Class of generalized Goppa codes perfect in weighted Hamming metric. 391-399

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from
to the list of external document links (if available).
load links from unpaywall.org
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the
of the Internet Archive (if available).
load content from archive.org
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from
,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from
and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from
.
load data from openalex.org
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:






