Publication | Date of Publication | Type |
---|
Asymptotic optimality of the GMD and Chase decoding algorithms | 2005-05-11 | Paper |
https://portal.mardi4nfdi.de/entity/Q3154852 | 2005-01-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q3154876 | 2005-01-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q4474269 | 2004-08-04 | Paper |
https://portal.mardi4nfdi.de/entity/Q4470471 | 2004-07-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4470511 | 2004-07-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4502627 | 2002-06-02 | Paper |
https://portal.mardi4nfdi.de/entity/Q4502610 | 2002-03-18 | Paper |
Constructions of generalized concatenated codes and their trellis-based decoding complexity | 1999-11-21 | Paper |
A low-weight trellis-based iterative soft-decision decoding algorithm for binary linear block codes | 1999-11-21 | Paper |
https://portal.mardi4nfdi.de/entity/Q4399936 | 1998-07-30 | Paper |
Soft-decision decoding of binary linear block codes based on an iterative search algorithm | 1998-03-22 | Paper |
https://portal.mardi4nfdi.de/entity/Q4373654 | 1998-02-16 | Paper |
The weight distributions of extended binary primitive BCH codes of length 128 | 1998-01-08 | Paper |
https://portal.mardi4nfdi.de/entity/Q4365522 | 1998-01-08 | Paper |
https://portal.mardi4nfdi.de/entity/Q4365523 | 1998-01-08 | Paper |
On bit-error probability of a concatenated coding scheme | 1997-10-28 | Paper |
Solving a unification problem under constrained substitutions using tree automata | 1997-05-28 | Paper |
The weight distribution of the third-order Reed-Muller code of length 512 | 1996-10-22 | Paper |
Suboptimum decoding of decomposable block codes | 1995-03-01 | Paper |
On the maximum value of aliasing probabilities for single input signature registers | 1995-01-01 | Paper |
Multistage decoding of multilevel block M-PSK modulation codes and its performance analysis | 1994-10-04 | Paper |
On complexity of trellis structure of linear block codes | 1994-02-07 | Paper |
On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes | 1993-05-16 | Paper |
On multiple context-free grammars | 1992-06-26 | Paper |
On the monotonic property of the probability of undetected error for a shortened code | 1992-06-26 | Paper |
On linear structure and phase rotation invariant properties of block M-PSK modulation codes | 1991-01-01 | Paper |
Performance analysis of disk allocation method using error-correcting codes | 1991-01-01 | Paper |
On multilevel block modulation codes | 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) | 1988-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3789477 | 1987-01-01 | Paper |
Compiling and optimizing methods for the functional language ASL/F | 1986-01-01 | Paper |
An approximation to the weight distribution of binary primitive BCH codes with designed distances 9 and 11 (Corresp.) | 1986-01-01 | Paper |
Coding for the binary symmetric broadcast channel with two receivers | 1985-01-01 | Paper |
An approximation to the weight distribution of binary linear codes | 1985-01-01 | Paper |
Some Results on the Representative Instance in Relational Databases | 1985-01-01 | Paper |
Membership problems for data dependencies in relational expressions | 1984-01-01 | Paper |
On the Probability of Undetected Error for the Maximum Distance Separable Codes | 1984-01-01 | Paper |
Three measures for synchronic dependence in Petri nets | 1983-01-01 | Paper |
Membership problem for embedded multivalued dependencies under some restricted conditions | 1983-01-01 | Paper |
Graph theoretic approaches to the code construction for the two-user multiple- access binary adder channel | 1983-01-01 | Paper |
Linear block codes for error detection (Corresp.) | 1983-01-01 | Paper |
Existence of Good δ-Decodable Codes for the Two-User Multiple-Access Adder Channel | 1980-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3851634 | 1979-01-01 | Paper |
Decision Problems for Multivalued Dependencies in Relational Databases | 1979-01-01 | Paper |
Bounds on the achievable rates of block coding for a memoryless multiple-access channel | 1978-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4163120 | 1978-01-01 | Paper |
An error correcting scheme for defective memory | 1978-01-01 | Paper |
Some decision problems related to the reachability problem for Petri nets | 1977-01-01 | Paper |
Decidable problems on the strong connectivity of Petri net reachability sets | 1977-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4137082 | 1977-01-01 | Paper |
An \(O(n)\) algorithm for computing the set of available expressions of D-charts | 1976-01-01 | Paper |
A result on the equivalence problem for deterministic pushdown automata | 1976-01-01 | Paper |
Coding for a multiple-access channel | 1976-01-01 | Paper |
On the weight enumeration of weights less than 2.5d of Reed—Muller codes | 1976-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4099209 | 1975-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4151713 | 1975-01-01 | Paper |
A Gilbert-Varshamov bound for quasi-cycle codes of rate 1/2 (Corresp.) | 1974-01-01 | Paper |
Construction and decomposition of cyclic codes of composite length (Corresp.) | 1974-01-01 | Paper |
On the capabilities of while, repeat, and exit statements | 1973-01-01 | Paper |
Minimal Negative Gate Networks | 1972-01-01 | Paper |
Some results on the minimum weight of primitive BCH codes (Corresp.) | 1972-01-01 | Paper |
The weight enumerators for several classes of subcodes of the 2nd order binary Reed-Muller codes | 1971-01-01 | Paper |
On majority-logic decoding for duals of primitive polynomial codes | 1971-01-01 | Paper |
On the construction of a class of majority-logic decodable codes | 1971-01-01 | Paper |
Erratum “Optimal Sequencing of Two Equivalent Processors” | 1971-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5642483 | 1971-01-01 | Paper |
On the weight structure of Reed-Muller codes | 1970-01-01 | Paper |
Reduction of context-free grammars | 1970-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5633663 | 1970-01-01 | Paper |
An upper bound on<tex>k/n</tex>for affine-invariant codes with fixed<tex>d/n</tex>(Corresp.) | 1969-01-01 | Paper |
Some Remarks on BCH Bounds and Minimum Weights of Binary Primitive BCH Codes | 1969-01-01 | Paper |
A note on computing time for the recognition of context-free languages by a single-tape Turing machine | 1969-01-01 | Paper |
Optimal Sequencing of Two Equivalent Processors | 1969-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5612988 | 1969-01-01 | Paper |
Error-correcting codes for a compound channel | 1968-01-01 | Paper |
On the Coding of the Path in a Graph and Some Applications | 1968-01-01 | Paper |
New generalizations of the Reed-Muller codes--I: Primitive codes | 1968-01-01 | Paper |
Some lower bounds on the minimum weight of cyclic codes of composite length | 1968-01-01 | Paper |
Polynomial codes | 1968-01-01 | Paper |
A note on computing time for recognition of languages generated by linear grammars | 1967-01-01 | Paper |
Some results on cyclic codes which are invariant under the affine group and their applications | 1967-01-01 | Paper |
A decoding procedure for multiple-error-correcting cyclic codes | 1964-01-01 | Paper |
Optimum shortened cyclic codes for burst-error correction | 1963-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3284181 | 1961-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5338581 | 1961-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5737519 | 1961-01-01 | Paper |