| Publication | Date of Publication | Type |
|---|
An ID-based key sharing scheme based on discrete logarithm problem over a product of three primes
JSIAM Letters | 2013-08-09 | Paper |
A note on performance of generalized tail biting trellis codes
Journal of Discrete Mathematical Sciences and Cryptography | 2011-06-10 | Paper |
Exponential error bounds and decoding complexity for block concatenated codes with tail biting trellis inner codes
Journal of Discrete Mathematical Sciences and Cryptography | 2006-11-16 | Paper |
| scientific article; zbMATH DE number 2065860 (Why is no real title available?) | 2004-05-18 | Paper |
| scientific article; zbMATH DE number 2065878 (Why is no real title available?) | 2004-05-18 | Paper |
| scientific article; zbMATH DE number 2065869 (Why is no real title available?) | 2004-05-18 | Paper |
| scientific article; zbMATH DE number 2065873 (Why is no real title available?) | 2004-05-18 | Paper |
| scientific article; zbMATH DE number 1508274 (Why is no real title available?) | 2002-07-16 | Paper |
A multicast hybrid ARQ scheme using MDS codes and GMD decoding
IEEE Transactions on Communications | 2002-01-07 | Paper |
Upper and lower bounds on maximum nonlinearity of \(n\)-input \(m\)-output Boolean function
Designs, Codes and Cryptography | 2001-07-29 | Paper |
| scientific article; zbMATH DE number 1486642 (Why is no real title available?) | 2000-08-21 | Paper |
| scientific article; zbMATH DE number 1486641 (Why is no real title available?) | 2000-08-21 | Paper |
| scientific article; zbMATH DE number 1486636 (Why is no real title available?) | 2000-08-20 | Paper |
On the minimum distance of a q-ary image of a q/sup m/-ary cyclic code
IEEE Transactions on Information Theory | 1997-03-12 | Paper |
Generalized key-equation of remainder decoding algorithm for Reed-Solomon codes
IEEE Transactions on Information Theory | 1993-02-04 | Paper |
Perfect staircase profile of linear complexity for finite sequences
Information Processing Letters | 1993-01-17 | Paper |
Efficient bit-serial multiplication and the discrete-time Wiener-Hopf equation over finite fields
IEEE Transactions on Information Theory | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4074965 (Why is no real title available?) | 1988-01-01 | Paper |
Separate codes on type-II hybrid ARQ systems
IEEE Transactions on Communications | 1988-01-01 | Paper |
Modified product codes
IEEE Transactions on Information Theory | 1984-01-01 | Paper |
New decoding algorithm for Reed - Muller codes (Corresp.)
IEEE Transactions on Information Theory | 1982-01-01 | Paper |
An improvement of error exponents at low rates for the generalized version of concatenated codes (Corresp.)
IEEE Transactions on Information Theory | 1981-01-01 | Paper |
Certain generalizations of concatenated codes--Exponential error bounds and decoding complexity
IEEE Transactions on Information Theory | 1980-01-01 | Paper |
Block codes capable of correcting both additive and timing errors
IEEE Transactions on Information Theory | 1980-01-01 | Paper |
Superimposed concatenated codes (Corresp.)
IEEE Transactions on Information Theory | 1980-01-01 | Paper |
A new class of asymptotically good codes beyond the Zyablov bound
IEEE Transactions on Information Theory | 1978-01-01 | Paper |
Error statistics and construction of error correcting codes for differentially encoded CPSK channels (Corresp.)
IEEE Transactions on Information Theory | 1978-01-01 | Paper |
Analysis of the fundamental error statistics in DPSK systems using a Markov chain model (Corresp.)
IEEE Transactions on Information Theory | 1977-01-01 | Paper |
An erasures-and-errors decoding algorithm for Goppa codes (Corresp.)
IEEE Transactions on Information Theory | 1976-01-01 | Paper |
Further results on Goppa codes and their applications to constructing efficient binary codes
IEEE Transactions on Information Theory | 1976-01-01 | Paper |
Correction to 'An Erasures-and-Errors Decoding Algorithm for Goppa Codes'
IEEE Transactions on Information Theory | 1976-01-01 | Paper |
New classes of binary codes constructed on the basis of concatenated codes and product codes
IEEE Transactions on Information Theory | 1976-01-01 | Paper |
A method for solving key equation for decoding goppa codes
Information and Control | 1975-01-01 | Paper |
Some efficient binary codes constructed using Srivastava codes (Corresp.)
IEEE Transactions on Information Theory | 1975-01-01 | Paper |
A new class of binary codes constructed on the basis of BCH codes (Corresp.)
IEEE Transactions on Information Theory | 1975-01-01 | Paper |
A modification of the constructive asymptotically good codes of Justesen for low rates
Information and Control | 1974-01-01 | Paper |
