|
|
|
Publications in Math-Net.Ru |
Citations |
|
2000 |
| 1. |
U. K. Sorger, J. Winter, “A Novel Construction of High-Rate Unit-Memory Codes”, Probl. Peredachi Inf., 36:2 (2000), 19–26   ; Problems Inform. Transmission, 36:2 (2000), 106–113 |
|
1996 |
| 2. |
U. Dettmar, R. Raschofer, U. K. Sorger, “On the Trellis Complexity of Block and Convolutional Codes”, Probl. Peredachi Inf., 32:2 (1996), 10–21  ; Problems Inform. Transmission, 32:1 (1996), 145–155 |
2
|
|
1995 |
| 3. |
R. Kötter, U. Dettmar, U. K. Sorger, “On the Construction of Trellis Codes Based on (P)UM Codes over $\mathbb Z_4$”, Probl. Peredachi Inf., 31:2 (1995), 67–75 ; Problems Inform. Transmission, 31:2 (1995), 154–161 |
| 4. |
U. Dettmar, U. K. Sorger, “Bounded Minimum Distance Decoding of (P)UM Codes Based on RS Codes”, Probl. Peredachi Inf., 31:2 (1995), 44–53 ; Problems Inform. Transmission, 31:2 (1995), 135–142 |
1
|
|
1994 |
| 5. |
U. K. Sorger, “A New Construction of Partial Unit Memory Codes Based on Reed–Solomon Codes”, Probl. Peredachi Inf., 30:4 (1994), 16–20 ; Problems Inform. Transmission, 30:4 (1994), 303–306 |
1
|
| 6. |
V. V. Zyablov, J. Justesen, U. Dettmar, U. K. Sorger, “Decoding Concatenated Codes with Inner Convolutional Codes”, Probl. Peredachi Inf., 30:2 (1994), 3–9 ; Problems Inform. Transmission, 30:2 (1994), 95–101 |
| |
|
|
Contact us: