The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Joachim Rosenthal: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Joachim Rosenthal, Roxana Smarandache
    Maximum Distance Separable Convolutional Codes. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1999, v:10, n:1, pp:15-32 [Journal]
  2. Joachim Rosenthal
    A Polynomial Description of the Rijndael Advanced Encryption Standard [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  3. Heide Gluesing-Luerssen, Joachim Rosenthal, Roxana Smarandache
    Strongly-MDS convolutional codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:2, pp:584-598 [Journal]
  4. Joachim Rosenthal, J. M. Schumacher, Eric V. York
    On behaviors and convolutional codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1881-1891 [Journal]
  5. Joachim Rosenthal, Eric V. York
    On the generalized Hamming weights of convolutional codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:330-334 [Journal]
  6. Joachim Rosenthal, Eric V. York
    BCH convolutional codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:6, pp:1833-1844 [Journal]
  7. Roxana Smarandache, Heide Gluesing-Luerssen, Joachim Rosenthal
    Constructions of MDS-convolutional codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:2045-2049 [Journal]
  8. Guangyue Han, Joachim Rosenthal
    Geometrical and Numerical Design of Structured Unitary Space-Time Constellations. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:8, pp:3722-3735 [Journal]
  9. Guangyue Han, Joachim Rosenthal
    Unitary Space-Time Constellation Analysis: An Upper Bound for the Diversity. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:10, pp:4713-4721 [Journal]
  10. Christine A. Kelley, Deepak Sridhara, Joachim Rosenthal
    Tree-Based Construction of LDPC Codes Having Good Pseudocodeword Weights. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2007, v:53, n:4, pp:1460-1478 [Journal]
  11. Davide Schipani, Joachim Rosenthal
    Coding Solutions for the Secure Biometric Storage Problem [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  12. Christine A. Kelley, Deepak Sridhara, Joachim Rosenthal
    Zig-zag and Replacement Product Graphs and LDPC Codes [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  13. Gérard Maze, Chris Monico, Joachim Rosenthal
    Public Key Cryptography based on Semigroup Actions [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  14. Christine A. Kelley, Deepak Sridhara, Joachim Rosenthal
    Pseudocodeword weights for non-binary LDPC codes [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  15. Tree-Based Construction of LDPC Codes [Citation Graph (, )][DBLP]


  16. Tree-Based Construction of LDPC Codes Having Good Pseudocodeword Weights [Citation Graph (, )][DBLP]


  17. Spread Codes and Spread Decoding in Network Coding [Citation Graph (, )][DBLP]


  18. Efficient recovering of operation tables of black box groups and rings [Citation Graph (, )][DBLP]


  19. Decoding of MDP Convolutional Codes over the Erasure Channel [Citation Graph (, )][DBLP]


  20. Decoding of Convolutional Codes over the Erasure Channel [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002