| Publication | Date of Publication | Type |
|---|
| Essays on Coding Theory | 2024-01-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5013052 | 2021-11-26 | Paper |
| Full Characterization of Optimal Uncoded Placement for the Structured Clique Cover Delivery of Nonuniform Demands | 2020-01-28 | Paper |
| On Short Cycle Enumeration in Biregular Bipartite Graphs | 2018-09-19 | Paper |
| Finite field multiplier using redundant representation | 2018-07-09 | Paper |
| New low-complexity bit-parallel finite field multipliers using weakly dual bases | 2018-07-09 | Paper |
| New Classes of Partial Geometries and Their Associated LDPC Codes | 2017-04-28 | Paper |
| A note on diagonal and Hermitian hypersurfaces | 2016-11-11 | Paper |
| VSH and multiplicative modular relations between small primes with polynomial exponents | 2014-09-18 | Paper |
| A transform property of Kloosterman sums | 2010-10-11 | Paper |
| Random matrices and codes for the erasure channel | 2010-02-23 | Paper |
| A note on window \(\tau\)-NAF algorithm | 2009-12-04 | Paper |
| One-round secure comparison of integers | 2009-06-12 | Paper |
| Nonadjacent Radix-τ Expansions of Integers in Euclidean Imaginary Quadratic Number Fields | 2008-12-12 | Paper |
| Graphs with integral spectrum | 2008-12-02 | Paper |
| Conditional Encrypted Mapping and Comparing Encrypted Numbers | 2008-09-09 | Paper |
| Construction of extended Steiner systems for information retrieval | 2008-06-18 | Paper |
| Polynomial approximation of bilinear Diffie-Hellman maps | 2008-04-22 | Paper |
| Conditionally Verifiable Signature | 2008-04-11 | Paper |
| Statistical distribution and collisions of VSH | 2008-02-21 | Paper |
| On the mean number of encryptions for tree-based broadcast encryption schemes | 2007-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3424725 | 2007-03-05 | Paper |
| On the bit security of the Diffie-Hellman key | 2006-09-12 | Paper |
| Refinements of Miller's algorithm for computing the Weil/Tate pairing | 2006-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3374402 | 2006-03-09 | Paper |
| Strong Conditional Oblivious Transfer and Computing on Intervals | 2005-08-12 | Paper |
| Efficient algorithms for Koblitz curves over fields of characteristic three | 2005-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3154879 | 2005-01-14 | Paper |
| On the complexity of the discrete logarithm and Diffie-Hellman problems | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4460823 | 2004-03-29 | Paper |
| On the security of the digital signature algorithm | 2002-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535945 | 2002-06-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4502611 | 2002-03-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4502794 | 2000-11-07 | Paper |
| On the trellis complexity of root lattices and their duals | 2000-09-07 | Paper |
| Trellis complexity and minimal trellis diagrams of lattices | 1999-11-21 | Paper |
| Algebraic-geometry codes | 1999-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4265362 | 1999-10-11 | Paper |
| Upper bound for uniquely decodable codes in a binary input N-user adder channel | 1999-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4382304 | 1998-08-31 | Paper |
| Trellis complexity versus the coding gain of lattices. I | 1998-03-10 | Paper |
| Trellis complexity versus the coding gain of lattices. II | 1998-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4354784 | 1997-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4349310 | 1997-08-17 | Paper |
| Normal basis of the finite field F/sub 2/(p-1)p/sup m/ over F/sub 2/ | 1997-07-20 | Paper |
| Specific irreducible polynomials with linearly independent roots over finite fields | 1997-05-13 | Paper |
| On the Trellis Complexity of the Densest Lattice Packings in $\mathbb{R}^n $ | 1996-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858426 | 1996-08-19 | Paper |
| Fast parallel algorithms for decoding Reed-Solomon codes based on remainder polynomials | 1996-04-15 | Paper |
| Coding for Adder Channels | 1996-01-11 | Paper |
| On the extendability of steiner t‐designs | 1995-07-11 | Paper |
| Normal and Self-Dual Normal Bases from Factorization of $cx^{q + 1} + dx^q - ax - b$ | 1994-10-24 | Paper |
| Two new decoding algorithms for Reed-Solomon codes | 1994-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3136478 | 1993-10-04 | Paper |
| Explicit factorization of \(x^{2^ k}+1\) over \(F_ p\) with prime \(p\equiv 3\bmod 4\) | 1993-06-29 | Paper |
| Hermitian codes as generalized Reed-Solomon codes | 1993-01-16 | Paper |
| On the Complete Weight Enumerator of Reed-Solomon Codes | 1991-01-01 | Paper |
| Bit Serial Multiplication in Finite Fields | 1990-01-01 | Paper |
| Low complexity normal bases | 1989-01-01 | Paper |
| Trellis source code design as an optimization problem | 1989-01-01 | Paper |
| Detector relative efficiency analysis in non-Gaussian noise | 1988-01-01 | Paper |
| Trellis source codes designed by conjugate gradient optimization | 1988-01-01 | Paper |
| Diversity and Coding for FH/MFSK Systems with Fading and Jamming--Part I: Multichannel Diversity | 1987-01-01 | Paper |
| Approximations for the probability in the tails of the binomial distribution (Corresp.) | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3693432 | 1985-01-01 | Paper |
| Computing Logarithms in Finite Fields of Characteristic Two | 1984-01-01 | Paper |
| Sequence acquisition using bit estimation techniques | 1984-01-01 | Paper |
| The enumeration of certain run length sequences | 1982-01-01 | Paper |
| A note on complex sequences with low correlations (Corresp.) | 1982-01-01 | Paper |
| Performance of Nonorthogonal Signaling on an Asynchronous Multiple Access On-Off Channel | 1982-01-01 | Paper |
| Coding with permutations | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4741461 | 1979-01-01 | Paper |
| Codes and Designs | 1979-01-01 | Paper |
| A note on generalized room squares | 1978-01-01 | Paper |
| On an inverse for sections of a binomial matrix | 1978-01-01 | Paper |
| Decoding the binary Golay code with miracle octad generators (Corresp.) | 1978-01-01 | Paper |
| Big Buckets Are (Are Not) Better! | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4133529 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3896960 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4096959 | 1976-01-01 | Paper |
| A construction method for generalized Room squares | 1976-01-01 | Paper |
| Combinatorial aspects of orthogonal parity checks (Corresp.) | 1976-01-01 | Paper |
| Codes over integer residue rings | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4081121 | 1975-01-01 | Paper |
| Majority logic decoding using combinatorial designs (Corresp.) | 1975-01-01 | Paper |
| An infinite class of generalized Room squares | 1975-01-01 | Paper |
| On a generalization of the pless symmetry codes | 1975-01-01 | Paper |
| Permutation codes for discrete channels (Corresp.) | 1974-01-01 | Paper |
| Configuration matrices of group codes | 1974-01-01 | Paper |
| Level-crossing problems for random processes | 1973-01-01 | Paper |
| Addresses for graphs | 1973-01-01 | Paper |
| Codes over certain rings | 1972-01-01 | Paper |
| An Optimization Problem for Unitary and Orthogonal Representations of Finite Groups | 1972-01-01 | Paper |
| Distance Properties of Group Codes for the Gaussian Channel | 1972-01-01 | Paper |
| The Leech lattice as a code for the Gaussian channel | 1971-01-01 | Paper |
| Linear filtering and piecewise linear correlation functions | 1969-01-01 | Paper |
| On a class of processes arising in linear estimation theory | 1968-01-01 | Paper |
