| Publication | Date of Publication | Type |
|---|
Asymptotic optimality of the GMD and Chase decoding algorithms
IEEE Transactions on Information Theory | 2005-05-11 | Paper |
| scientific article; zbMATH DE number 2127862 (Why is no real title available?) | 2005-01-14 | Paper |
| scientific article; zbMATH DE number 2127883 (Why is no real title available?) | 2005-01-14 | Paper |
| scientific article; zbMATH DE number 2081151 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2077093 (Why is no real title available?) | 2004-07-01 | Paper |
| scientific article; zbMATH DE number 2077127 (Why is no real title available?) | 2004-07-01 | Paper |
| scientific article; zbMATH DE number 1504665 (Why is no real title available?) | 2002-06-02 | Paper |
| scientific article; zbMATH DE number 1504650 (Why is no real title available?) | 2002-03-18 | Paper |
Constructions of generalized concatenated codes and their trellis-based decoding complexity
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
A low-weight trellis-based iterative soft-decision decoding algorithm for binary linear block codes
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
| scientific article; zbMATH DE number 1181550 (Why is no real title available?) | 1998-07-30 | Paper |
Soft-decision decoding of binary linear block codes based on an iterative search algorithm
IEEE Transactions on Information Theory | 1998-03-22 | Paper |
| scientific article; zbMATH DE number 1107709 (Why is no real title available?) | 1998-02-16 | Paper |
The weight distributions of extended binary primitive BCH codes of length 128
IEEE Transactions on Information Theory | 1998-01-08 | Paper |
| scientific article; zbMATH DE number 1083570 (Why is no real title available?) | 1998-01-08 | Paper |
| scientific article; zbMATH DE number 1083571 (Why is no real title available?) | 1998-01-08 | Paper |
On bit-error probability of a concatenated coding scheme
IEEE Transactions on Communications | 1997-10-28 | Paper |
Solving a unification problem under constrained substitutions using tree automata
Journal of Symbolic Computation | 1997-05-28 | Paper |
The weight distribution of the third-order Reed-Muller code of length 512
IEEE Transactions on Information Theory | 1996-10-22 | Paper |
Suboptimum decoding of decomposable block codes
IEEE Transactions on Information Theory | 1995-03-01 | Paper |
On the maximum value of aliasing probabilities for single input signature registers
IEEE Transactions on Computers | 1995-01-01 | Paper |
Multistage decoding of multilevel block M-PSK modulation codes and its performance analysis
IEEE Transactions on Information Theory | 1994-10-04 | Paper |
On complexity of trellis structure of linear block codes
IEEE Transactions on Information Theory | 1994-02-07 | Paper |
On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes
IEEE Transactions on Information Theory | 1993-05-16 | Paper |
On multiple context-free grammars
Theoretical Computer Science | 1992-06-26 | Paper |
On the monotonic property of the probability of undetected error for a shortened code
IEEE Transactions on Information Theory | 1992-06-26 | Paper |
On multilevel block modulation codes
IEEE Transactions on Information Theory | 1991-01-01 | Paper |
On linear structure and phase rotation invariant properties of block M-PSK modulation codes
IEEE Transactions on Information Theory | 1991-01-01 | Paper |
Performance analysis of disk allocation method using error-correcting codes
IEEE Transactions on Information Theory | 1991-01-01 | Paper |
The binary weight distribution of the extended (2 m,2 m-4) code of the Reed-Solomon code over GF(2 m) with generator polynomial (x-\(\alpha\) )(x- \(\alpha\) 2)(x-\(\alpha\) 3)
Linear Algebra and its Applications | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4053510 (Why is no real title available?) | 1987-01-01 | Paper |
An approximation to the weight distribution of binary primitive BCH codes with designed distances 9 and 11 (Corresp.)
IEEE Transactions on Information Theory | 1986-01-01 | Paper |
Compiling and optimizing methods for the functional language ASL/F
Science of Computer Programming | 1986-01-01 | Paper |
Some Results on the Representative Instance in Relational Databases
SIAM Journal on Computing | 1985-01-01 | Paper |
Coding for the binary symmetric broadcast channel with two receivers
IEEE Transactions on Information Theory | 1985-01-01 | Paper |
An approximation to the weight distribution of binary linear codes
IEEE Transactions on Information Theory | 1985-01-01 | Paper |
Membership problems for data dependencies in relational expressions
Theoretical Computer Science | 1984-01-01 | Paper |
On the Probability of Undetected Error for the Maximum Distance Separable Codes
IEEE Transactions on Communications | 1984-01-01 | Paper |
Three measures for synchronic dependence in Petri nets
Acta Informatica | 1983-01-01 | Paper |
Graph theoretic approaches to the code construction for the two-user multiple- access binary adder channel
IEEE Transactions on Information Theory | 1983-01-01 | Paper |
Linear block codes for error detection (Corresp.)
IEEE Transactions on Information Theory | 1983-01-01 | Paper |
Membership problem for embedded multivalued dependencies under some restricted conditions
Theoretical Computer Science | 1983-01-01 | Paper |
Existence of Good δ-Decodable Codes for the Two-User Multiple-Access Adder Channel
IBM Journal of Research and Development | 1980-01-01 | Paper |
Decision Problems for Multivalued Dependencies in Relational Databases
SIAM Journal on Computing | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3651758 (Why is no real title available?) | 1979-01-01 | Paper |
An error correcting scheme for defective memory
IEEE Transactions on Information Theory | 1978-01-01 | Paper |
Bounds on the achievable rates of block coding for a memoryless multiple-access channel
IEEE Transactions on Information Theory | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3596731 (Why is no real title available?) | 1978-01-01 | Paper |
Some decision problems related to the reachability problem for Petri nets
Theoretical Computer Science | 1977-01-01 | Paper |
Decidable problems on the strong connectivity of Petri net reachability sets
Theoretical Computer Science | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3564858 (Why is no real title available?) | 1977-01-01 | Paper |
Coding for a multiple-access channel
IEEE Transactions on Information Theory | 1976-01-01 | Paper |
On the weight enumeration of weights less than 2.5d of Reed—Muller codes
Information and Control | 1976-01-01 | Paper |
A result on the equivalence problem for deterministic pushdown automata
Journal of Computer and System Sciences | 1976-01-01 | Paper |
An \(O(n)\) algorithm for computing the set of available expressions of D-charts
Acta Informatica | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3521513 (Why is no real title available?) | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3583262 (Why is no real title available?) | 1975-01-01 | Paper |
A Gilbert-Varshamov bound for quasi-cycle codes of rate 1/2 (Corresp.)
IEEE Transactions on Information Theory | 1974-01-01 | Paper |
Construction and decomposition of cyclic codes of composite length (Corresp.)
IEEE Transactions on Information Theory | 1974-01-01 | Paper |
On the capabilities of while, repeat, and exit statements
Communications of the ACM | 1973-01-01 | Paper |
Minimal Negative Gate Networks
IEEE Transactions on Computers | 1972-01-01 | Paper |
Some results on the minimum weight of primitive BCH codes (Corresp.)
IEEE Transactions on Information Theory | 1972-01-01 | Paper |
The weight enumerators for several classes of subcodes of the 2nd order binary Reed-Muller codes
Information and Control | 1971-01-01 | Paper |
Erratum “Optimal Sequencing of Two Equivalent Processors”
SIAM Journal on Applied Mathematics | 1971-01-01 | Paper |
On majority-logic decoding for duals of primitive polynomial codes
IEEE Transactions on Information Theory | 1971-01-01 | Paper |
On the construction of a class of majority-logic decodable codes
IEEE Transactions on Information Theory | 1971-01-01 | Paper |
| scientific article; zbMATH DE number 3370239 (Why is no real title available?) | 1971-01-01 | Paper |
On the weight structure of Reed-Muller codes
IEEE Transactions on Information Theory | 1970-01-01 | Paper |
Reduction of context-free grammars
Information and Control | 1970-01-01 | Paper |
| scientific article; zbMATH DE number 3359799 (Why is no real title available?) | 1970-01-01 | Paper |
An upper bound on<tex>k/n</tex>for affine-invariant codes with fixed<tex>d/n</tex>(Corresp.)
IEEE Transactions on Information Theory | 1969-01-01 | Paper |
Optimal Sequencing of Two Equivalent Processors
SIAM Journal on Applied Mathematics | 1969-01-01 | Paper |
| scientific article; zbMATH DE number 3335651 (Why is no real title available?) | 1969-01-01 | Paper |
Some Remarks on BCH Bounds and Minimum Weights of Binary Primitive BCH Codes
IEEE Transactions on Information Theory | 1969-01-01 | Paper |
A note on computing time for the recognition of context-free languages by a single-tape Turing machine
Information and Control | 1969-01-01 | Paper |
New generalizations of the Reed-Muller codes--I: Primitive codes
IEEE Transactions on Information Theory | 1968-01-01 | Paper |
Polynomial codes
IEEE Transactions on Information Theory | 1968-01-01 | Paper |
Some lower bounds on the minimum weight of cyclic codes of composite length
IEEE Transactions on Information Theory | 1968-01-01 | Paper |
Error-correcting codes for a compound channel
IEEE Transactions on Information Theory | 1968-01-01 | Paper |
On the Coding of the Path in a Graph and Some Applications
SIAM Journal on Applied Mathematics | 1968-01-01 | Paper |
Some results on cyclic codes which are invariant under the affine group and their applications
Information and Control | 1967-01-01 | Paper |
A note on computing time for recognition of languages generated by linear grammars
Information and Control | 1967-01-01 | Paper |
A decoding procedure for multiple-error-correcting cyclic codes
IEEE Transactions on Information Theory | 1964-01-01 | Paper |
Optimum shortened cyclic codes for burst-error correction
IEEE Transactions on Information Theory | 1963-01-01 | Paper |
| scientific article; zbMATH DE number 3165843 (Why is no real title available?) | 1961-01-01 | Paper |
| scientific article; zbMATH DE number 3211355 (Why is no real title available?) | 1961-01-01 | Paper |
| scientific article; zbMATH DE number 3201101 (Why is no real title available?) | 1961-01-01 | Paper |
