UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Probabilistic Existence Results for Separable Codes

IEEE transactions on information theory, 2015-11, Vol.61 (11), p.5822-5827

Blackburn, Simon R.

2015

Volltextzugriff (PDF)

PIR Array Codes With Optimal Virtual Server Rate

IEEE transactions on information theory, 2019-10, Vol.65 (10), p.6136-6145

2019

Volltextzugriff (PDF)

Surveys in Combinatorics 2013

1, 2013

Volltextzugriff (PDF)

Constructions and bounds for codes with restricted overlaps

IEEE transactions on information theory, 2024-04, Vol.70 (4), p.1-1

2024

Volltextzugriff (PDF)

Finite-Field Matrix Channels for Network Coding

IEEE transactions on information theory, 2019-03, Vol.65 (3), p.1614-1625

2019

Volltextzugriff (PDF)

PIR Schemes With Small Download Complexity and Low Storage Requirements

IEEE transactions on information theory, 2020-01, Vol.66 (1), p.557-571

2020

Volltextzugriff (PDF)

Block‐avoiding point sequencings

Journal of combinatorial designs, 2021-06, Vol.29 (6), p.339-366

2021

Volltextzugriff (PDF)

Maximum Likelihood Decoding for Multilevel Channels With Gain and Offset Mismatch

IEEE transactions on information theory, 2016-03, Vol.62 (3), p.1144-1149

Blackburn, Simon R.

2016

Volltextzugriff (PDF)

Enumeration of Finite Groups

1, 2007

Volltextzugriff (PDF)

Connectivity of the uniform random intersection graph

Discrete mathematics, 2009-08, Vol.309 (16), p.5130-5140

2009

Volltextzugriff (PDF)

Pearson Codes

IEEE transactions on information theory, 2016-01, Vol.62 (1), p.131-135

2016

Volltextzugriff (PDF)

The discrete logarithm problem modulo one: cryptanalysing the Ariffin–Abu cryptosystem

Journal of mathematical cryptology, 2010-10, Vol.4 (2), p.193-198

Blackburn, Simon R.

2010

Volltextzugriff (PDF)

The Asymptotic Behavior of Grassmannian Codes

IEEE transactions on information theory, 2012-10, Vol.58 (10), p.6605-6609

2012

Volltextzugriff (PDF)

Cryptanalysis of three matrix-based key establishment protocols

Journal of mathematical cryptology, 2012-04, Vol.5 (2), p.159-168

2012

Volltextzugriff (PDF)

Constructing k-radius sequences

Mathematics of computation, 2012-10, Vol.81 (280), p.2439-2459

2012

Volltextzugriff (PDF)

Cryptanalysis of the MST3 public key cryptosystem

Journal of mathematical cryptology, 2009-12, Vol.3 (4), p.321-338

2009

Volltextzugriff (PDF)

The probability that a pair of elements of a finite group are conjugate

Journal of the London Mathematical Society, 2012-12, Vol.86 (3), p.755-778

2012

Volltextzugriff (PDF)

Preface to the special issue on network coding and designs

Designs, codes, and cryptography, 2018-02, Vol.86 (2), p.237-238

2018

Volltextzugriff (PDF)

Permutations that separate close elements

Journal of combinatorial theory. Series A, 2023-05, Vol.196, p.105734, Article 105734

Blackburn, Simon R.

2023

Volltextzugriff (PDF)

Permutations that Separate Close Elements, and Rectangle Packings in the Torus

The Electronic journal of combinatorics, 2024-11, Vol.31 (4)

2024

Volltextzugriff (PDF)

Frameproof codes

SIAM journal on discrete mathematics, 2003-01, Vol.16 (3), p.499-510

BLACKBURN, Simon R

2003

Volltextzugriff (PDF)

Non-Overlapping Codes

IEEE transactions on information theory, 2015-09, Vol.61 (9), p.4890-4894

Blackburn, Simon R.

2015

Volltextzugriff (PDF)

Distinct Difference Configurations: Multihop Paths and Key Predistribution in Sensor Networks

IEEE transactions on information theory, 2010-08, Vol.56 (8), p.3961-3972

2010

Volltextzugriff (PDF)

On the average energy of circulant graphs

Linear algebra and its applications, 2008-04, Vol.428 (8-9), p.1956-1963

2008

Volltextzugriff (PDF)

Two-Dimensional Patterns With Distinct Differences-Constructions, Bounds, and Maximal Anticodes

IEEE transactions on information theory, 2010-03, Vol.56 (3), p.1216-1229

2010

Volltextzugriff (PDF)

1 – 25 von 215

Menü

Weitere Dienste

Einstellungen

Probabilistic Existence Results for Separable Codes

PIR Array Codes With Optimal Virtual Server Rate

Surveys in Combinatorics 2013

Constructions and bounds for codes with restricted overlaps

Finite-Field Matrix Channels for Network Coding

PIR Schemes With Small Download Complexity and Low Storage Requirements

Block‐avoiding point sequencings

Maximum Likelihood Decoding for Multilevel Channels With Gain and Offset Mismatch

Enumeration of Finite Groups

Connectivity of the uniform random intersection graph

Pearson Codes

The discrete logarithm problem modulo one: cryptanalysing the Ariffin–Abu cryptosystem

The Asymptotic Behavior of Grassmannian Codes

Cryptanalysis of three matrix-based key establishment protocols

Constructing k-radius sequences

Cryptanalysis of the MST3 public key cryptosystem

The probability that a pair of elements of a finite group are conjugate

Preface to the special issue on network coding and designs

Permutations that separate close elements

Permutations that Separate Close Elements, and Rectangle Packings in the Torus

Frameproof codes

Non-Overlapping Codes

Distinct Difference Configurations: Multihop Paths and Key Predistribution in Sensor Networks

On the average energy of circulant graphs

Two-Dimensional Patterns With Distinct Differences-Constructions, Bounds, and Maximal Anticodes

Suchergebnisse filtern