Decoding of MDP Convolutional Codes over the Erasure Channel (2009)
Tomás, Virtudes, Rosenthal, Joachim, Smarandache, Roxana
This paper studies the decoding capabilities of maximum distance profile (MDP) convolutional codes over the erasure channel and compares them with the decoding capabilities of MDS block codes over...
Convolutional Codes and Systems over Finite Fields (2009)
Joachim Rosenthal, Joachim Rosenthal
Cryptography has a long history and its main objective is the transmission of data between two parties in a way which guarantees the privacy of the information. There are other interesting...
Public key cryptography based on semigroup actions, Adv (2008)
Gérard Maze, Chris Monico, Joachim Rosenthal
(Communicated by Andreas Stein) Abstract. A generalization of the original Diffie-Hellman key exchange in (Z/pZ) ∗ found a new depth when Miller [27] and Koblitz [16] suggested that such a protocol...
Spread Codes and Spread Decoding in Network Coding (2008)
Manganiello, Felice, Gorla, Elisa, Rosenthal, Joachim
In this paper we introduce the class of Spread Codes for the use in random network coding. Spread Codes are based on the construction of spreads in finite projective geometry. The major contribution...
Efficient recovering of operation tables of black box groups and rings (2008)
Zumbragel, Jens, Maze, Gerard, Rosenthal, Joachim
People have been studying the following problem: Given a finite set S with a hidden (black box) binary operation * on S which might come from a group law, and suppose you have access to an oracle...
On Behaviors and Convolutionail Codes (2008)
Joachim Rosenthal, Senior Member, J. M. Schumacher, Eric V. York, Student Member
Abstract-It is well known that a convolutional code is essen-tially a linear system defined over a finite field. In this paper we elaborate on this connection. We will define a convolutional code as...
Departament de Ciència de la Computació (2008)
Joan-josep Climent, Elisa Gorla, Joachim Rosenthal
(Communicated by Hovav Shacham) Abstract. The paper analyzes CFVZ, a new public key cryptosystem whose security is based on a matrix version of the discrete logarithm problem over an elliptic curve....
An Observability Criterion for Dynamical Systems Governed by Riccati Differential Equations (2008)
Abstract- In this Paper we Present an observability Critafon for systems whose state is governed by a matrix Riccati differential equation and whose output is given by an affine transformation. I.
Convolutional Codes, Joachim Rosenthal
The class of convolutional codes generalizes the class of linear block codes in a natural way. The construction of convolutional codes which have a large free distance and which come with an e cient...
J. Carmelo Interl, Eimear Byrne, Joachim Rosenthal
Abstract. Let A = (aij)k×n be a matrix with entries in the Galois field GF (2), and let x = (x1, x2,..., xn) t be a vector of variables assuming values in GF (2). The gate complexity of A, denoted...
The Multiplicative Inverse Eigenvalue Problem over an Algebraically Closed Field (2007)
Joachim Rosenthal, Xiaochang Wang
Let M be an n \Theta n square matrix and let p() be a monic polynomial of degree n. Let Z be a set of n \Theta n matrices. The multiplicative inverse eigenvalue problem asks for the construction of a...
Output Feedback Invariants (2007)
M. S. Ravi, Joachim Rosenthal, Uwe Helmke
The paper is concerned with the problem of determining a complete set of invariants for output feedback. Using tools from geometric invariant theory it is shown that there exists a quasi-projective...
An Observability Criterion for Dynamical Systems Governed by Riccati Differential Equations (2007)
In this short note we presentanobservability criterion for systems whose state is governed by a matrix Riccati di#erential equation and whose output is given by an a#ne transformation. I....
An Observability Criterion for Dynamical Systems Governed by Riccati Differential Equations (2007)
In this short note we present an observability criterion for systems whose state is governed by a matrix Riccati differential equation and whose output is given by an affine transformation. I....
Roxana Smarandache, Heide Gluesing-luerssen, Joachim Rosenthal
A new class of of rate 1/2 convolutional codes called strongly MDS convolutional codes are introduced and studied. These are codes having optimal column distances. Properties of these codes are given...
Unitary Constellation Design with Application to Space-Time Coding (2007)
Guangyue Han, Joachim Rosenthal
Recently unitary space-time modulation has been presented to give a solution to more reliable multiple antennas communications. Good-performing unitary constellations are required to be designed to...
Multiplicities of points on Schubert varieties in Grassmannians (2007)
Joachim Rosenthal, Andrei Zelevinsky
Abstract. We obtain an explicit determinantal formula for the multiplicity of any point on a classical Schubert variety. 1. Main result An important invariant of a singular point on an algebraic...
WHAT IS THE DISTANCE BETWEEN TWO AUTOREGRESSIVE SYSTEMS? (2007)
Joachim Rosenthal, Xiaochang Wang
In the recent control literature there has been a great interest in controller design techniques which are robust with respect to plant perturbations. Crucial for all robustness studies is of course...
1 The Behavior of Convolutional Codes (2007)
J. Rosenthal, E. V. York, Mathematisch Centrum (smc, The Dutch Foundation, Joachim Rosenthal, J. M. Schumacher, ...
and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of
1 Realization by Inspection (2007)
J. Rosenthal, Joachim Rosenthal, J. M. Schumacher, J. M. Schumacher
and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of
Constructions of MDS-Convolutional Codes Roxana Smarandache, Student Member, IEEE, (2007)
Heide Gluesing-luerssen, Joachim Rosenthal, Senior Member
Abstract---Maximum-distance separable (MDS) convolutional codes are characterized through the property that the free distance attains the generalized Singleton bound. The existence of MDS...
Constructions of MDS-Convolutional Codes Roxana Smarandache, Student Member, IEEE, (2007)
Heide Gluesing-luerssen, Joachim Rosenthal, Senior Member
Abstract—Maximum-distance separable (MDS) convolutional codes are characterized through the property that the free distance attains the generalized Singleton bound. The existence of MDS...
Department of Mathematics, (2007)
Joachim Rosenthal, Frank Sottile, St. George Street
We provide some new necessary and sufficient conditions which guarantee arbitrary pole placement of a particular linear system over the complex numbers. We exhibit a non-trivial real linear system...
Department of Mathematics, (2007)
Joachim Rosenthal, Frank Sottile, St. George Street
We provide some new necessary and sucient conditions which guarantee arbitrary pole placement of a particular linear system over the complex numbers. We exhibit a non-trivial real linear system which...
1 A Behavioral Approach to Singular Systems (2007)
J. Rosenthal, Mathematisch Centrum (smc, The Dutch Foundation, V. Lomadze, V. Lomadze, M. S. Ravi, ...
and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of
Pole Placement and Matrix Extension Problems: A Common Point of View (2007)
Joachim Rosenthal, Xiaochang Alex Wang, Alex Wang, Dedicated Memory, Meeyoung Kim, Meeyoung Kim
The paper studies a general inverse eigenvalue problem which generalizes many well studied pole placement and matrix extension problems. It is shown that the problem corresponds geometrically to a...
Hasse Diagram And Dynamic Feedback Of (2007)
Linear Systems Xiaochang, Xiaochang Wang, Joachim Rosenthal
this paper is that the variety K p,m has associated a Hasse diagram, a certain partially ordered set determined by m, p and q. In this diagram the number d(p, m, q) can be identified with the number...
A Polynomial Description of the Rijndael Advanced Encryption Standard (2007)
The paper gives a polynomial description of the Rijndael Advanced Encryption Standard recently adopted by the National Institute of Standards and Technology. Special attention is given to the...
Open Problems On, Vincent D. Blondel, Alexander Megretski, Roger Brockett, Jean-michel Coron, Miroslav Krstic, ...
this paper we consider the well-known Schur problem the solution of which satisfy in addition the extremal condition (z)w(z) min ; jzj < 1 (58.1) where w(z) and min are mxm matrices and min > 0...
Coding Solutions for the Secure Biometric Storage Problem (2007)
Schipani, Davide, Rosenthal, Joachim
The paper studies the problem of securely storing biometric passwords, such as fingerprints and irises. With the help of coding theory Juels and Wattenberg derived in 1999 a scheme where similar...
Tree-based construction of LDPC codes having good pseudocodeword weights (2007)
Christine A. Kelley, Deepak Sridhara, Joachim Rosenthal, Senior Member
Abstract—We present a tree-based construction of low-density parity-check (LDPC) codes that have minimum pseudocodeword weight equal to or almost equal to the minimum distance, and perform well...
Zig-zag and Replacement Product Graphs and LDPC Codes (2006)
Kelley, Christine A., Sridhara, Deepak, Rosenthal, Joachim
The performance of codes defined from graphs depends on the expansion property of the underlying graph in a crucial way. Graph products, such as the zig-zag product and replacement product provide...
Pseudocodeword weights for non-binary LDPC codes (2006)
Kelley, Christine A., Sridhara, Deepak, Rosenthal, Joachim
Pseudocodewords of q-ary LDPC codes are examined and the weight of a pseudocodeword on the q-ary symmetric channel is defined. The weight definition of a pseudocodeword on the AWGN channel is also...
Cryptanalysis of the CFVZ cryptosystem (2006)
Joan-josep Climent, Joachim Rosenthal, Elisa Gorla
The paper analyzes a new public key cryptosystem whose security is based on a matrix version of the discrete logarithm problem over an elliptic curve.
Geometrical and numerical design of structured unitary space-time constellations (2006)
Guangyue Han, Joachim Rosenthal
Unitary space-time modulation using multiple antennas promises reliable communication at high transmission rates. The basic principles are well understood and certain criteria for designing good...
Output Feedback Pole Assignment for Transfer Functions with Symmetries (2005)
Helmke, Uwe, Rosenthal, Joachim, Wang, Alex
This paper studies the problem of pole assignment for symmetric and Hamiltonian transfer functions. A necessary and sufficient condition for pole assignment by complex symmetric output feedback...
Tree-Based Construction of LDPC Codes Having Good Pseudocodeword Weights (2005)
Kelley, Christine, Sridhara, Deepak, Rosenthal, Joachim
We present a tree-based construction of LDPC codes that have minimum pseudocodeword weight equal to or almost equal to the minimum distance, and perform well with iterative decoding. The construction...
Tree-Based Construction of LDPC Codes (2005)
Sridhara, Deepak, Kelley, Christine, Rosenthal, Joachim
We present a construction of LDPC codes that have minimum pseudocodeword weight equal to the minimum distance, and perform well with iterative decoding. The construction involves enumerating a...
Tree-based construction of LDPC codes (2005)
Deepak Sridhara, Christine Kelley, Joachim Rosenthal
Abstract — We present a construction of LDPC codes that have minimum pseudocodeword weight equal to the minimum distance, and perform well with iterative decoding. The construction involves...
Heide Gluesing-luerssen, Roxana Smarandache, Joachim Rosenthal
MDS convolutional codes have the property that their free distance is maximal among all codes of the same rate and the same degree. In this paper a class of MDS convolutional codes is introduced...
Unitary Space Time Constellation Analysis: An Upper Bound for the Diversity (2004)
Han, Guangyue, Rosenthal, Joachim
The diversity product and the diversity sum are two very important parameters for a good-performing unitary space time constellation. A basic question is what the maximal diversity product (or sum)...
Geometrical and Numerical Design of Structured Unitary Space Time Constellations (2003)
Han, Guangyue, Rosenthal, Joachim
In this paper we propose constellations with suitable structure which allow one to construct codes with excellent diversity using geometrical symmetry and numerical methods. We also demonstrate how...
Strongly MDS Convolutional Codes (2003)
Gluesing-Luerssen, Heide, Rosenthal, Joachim, Smarandache, Roxana
MDS convolutional codes have the property that their free distance is maximal among all codes of the same rate and the same degree. In this paper we introduce a class of MDS convolutional codes whose...
Some new algebraic constructions of codes from graphs which are good expanders (2003)
Christine Kelley, Joachim Rosenthal, Deepak Sridhara
The design of LDPC codes based on a class of expander graphs is investigated. Graph products, such as the zig-zag product [9], of smaller expander graphs have been shown to yield larger expanders....
ALGEBRAIC METHODS FOR CONSTRUCTING ONE-WAY (2003)
Under Direction, Joachim Rosenthal, Trapdoor Functions
In this dissertation, we consider an extension of the discrete logarithm problem to the case of a semigroup acting on a finite set: the Semigroup Action Problem (SAP). New protocols and one-way...
Some new algebraic constructions of codes from graphs which are good expanders (2003)
Christine Kelley, Joachim Rosenthal, Deepak Sridhara
The design of LDPC codes based on a class of expander graphs is investigated. Graph products, such as the zig-zag product [9], of smaller expander graphs have been shown to yield larger expanders....
A Numerical Approach for Designing Unitary Space Time Codes with Large Diversity (2002)
Han, Guangyue, Rosenthal, Joachim
A numerical approach to design unitary constellation for any dimension and any transmission rate under non-coherent Rayleigh flat fading channel.
A Polynomial Description of the Rijndael Advanced Encryption Standard (2002)
The paper gives a polynomial description of the Rijndael Advanced Encryption Standard recently adopted by the National Institute of Standards and Technology. Special attention is given to the...
Public key cryptography based on simple modules over simple rings (2002)
Gérard Maze, Chris Monico, Joachim Rosenthal, Joan-josep Climent
The Diffie Hellman key exchange and the ElGamal oneway trapdoor function are the basic ingredients of public key cryptography. Both these protocols are based on the hardness of the discrete logarithm...
Unitary Constellations with Large Diversity Sum (2002)
And Good Diversity, Guangyue Han, Joachim Rosenthal
There exist two important design criterions for unitary space time codes. In the situation where the signal to noise ratio is large it is well known that the diversity product of a constellation...
Unitary constellations with large diversity sum and good diversity product (2002)
Guangyue Han, Joachim Rosenthal
Abstract There exist two important design criterions for unitary space time codes. In the situation where the signal to noise ratio is large it is well known that the diversity product of a...
Multiplicities Of Points On Schubert Varieties In Grassmannians (2001)
Joachim Rosenthal, Andrei Zelevinsky
We obtain an explicit determinantal formula for the multiplicity of any point on a classical Schubert variety.
Unitary Matrices with Maximal or near Maximal Diversity Product (2001)
Guangyue Han, Joachim Rosenthal, Keith Portman
Fully diversified constellations with large diversity product are playing an important role in improving the data rate of systems with multiple antennas. In this paper we study some optimal and some...
Output Feedback Invariants (2000)
Ravi, M. S., Rosenthal, Joachim, Helmke, Uwe
The paper is concerned with the problem of determining a complete set of invariants for output feedback. Using tools from geometric invariant theory it is shown that there exists a quasi-projective...
The Multiplicative Inverse Eigenvalue Problem over an Algebraically Closed Field (2000)
Rosenthal, Joachim, Wang, Xiaochang
Let $M$ be a square matrix and let $p(t)$ be a monic polynomial of degree $n$. Let $Z$ be a set of $n\times n$ matrices. The multiplicative inverse eigenvalue problem asks for the construction of a...
Connections between Linear Systems and Convolutional Codes (2000)
The article reviews different definitions for a convolutional code which can be found in the literature. The algebraic differences between the definitions are worked out in detail. It is shown that...
Constructions of LDPC codes using Ramanujan graphs and ideas from Margulis (2000)
Joachim Rosenthal, Pascal O. Vontobel
Some twenty years ago G.A. Margulis [8] proposed an algebraic construction of LDPC codes. In this paper we analyze the performance of the codes proposed by Margulis. Mimicking the construction of...
Connections between Linear Systems and Convolutional Codes (2000)
The article reviews dierent denitions for a convolutional code which can be found in the literature. The algebraic dierences between the denitions are worked out in detail. It is shown that bi-innite...
Eigenvalue Completions By Affine Varieties (2000)
Joachim Rosenthal, Xiaochang Wang
. In this paper we provide new necessary and sufficient conditions for a general class of eigenvalue completion problems. 1. Preliminaries Let F be an algebraically closed field of characteristic...
Output Feedback Invariants ∗ (2000)
M. S. Ravi, Uwe Helmke, Joachim Rosenthal
The paper is concerned with the problem of determining a complete set of invariants for output feedback. Using tools from geometric invariant theory it is shown that there exists a quasi-projective...
Duality between multidimensional convolutional codes and systems (2000)
Heide Gluesing-luerssen, Paul A. Weiner, Joachim Rosenthal
Abstract: Multidimensional convolutional codes arise as a generalization of “classical” onedimensional codes. We will introduce m-dimensional convolutional codes of length n as submodules of D n...
Duality between Multidimensional Convolutional Codes and Systems (1999)
Gluesing-Luerssen, Heide, Rosenthal, Joachim, Weiner, Paul
Multidimensional convolutional codes generalize (one dimensional) convolutional codes and they correspond under a natural duality to multidimensional systems widely studied in the systems literature.
Zero Assignment, Pole Placement and Matrix Extension Problems: A Common Point of View (1999)
Kim, Meeyoung, Rosenthal, Joachim, Wang, Xiaochang Alex
The paper studies a general inverse eigenvalue problem which contains as special cases many well studied pole placement and matrix extension problems. It is shown that the studied problem corresponds...
Vincent D. Blondel, Alexander Megretski, Roger Brockett, Jean-michel Coron, Miroslav Krstic, Anders Rantzer, ...
Some of the problems appearing in this booklet will appear in a more extensive forthcoming book on open problems in systems theory. For more information about this future book, please consult the...
Eigenvalue Completions by Affine Varieties (1999)
Joachim Rosenthal, Xiaochang Wang
. In this paper we provide new necessary and su#cient conditions for a general class of eigenvalue completion problems. 1. Preliminaries Let F be an algebraically closed field of characteristic zero....
Duality between Multidimensional Convolutional Codes and Systems (1999)
Heide Gluesing-Luerssen, Joachim Rosenthal, Paul A. Weiner
this paper. The following example will illustrate the usefulness of multidimensional convolutional codes. Example 1.1 Let D = F[z 1 ; z 2 ; z 3 ] be the polynomial ring in the indeterminates
Constructions of MDS-Convolutional Codes (1999)
Roxana Smarandache, Heide Gluesing-Luerssen, Joachim Rosenthal
Maximum distance separable (MDS) convolutional codes are characterized through the property that the free distance attains the generalized Singleton bound. The existence of MDS convolutional codes...
BCH Convolutional Codes (1999)
Joachim Rosenthal, Eric V. York
Using a new parity check matrix, a class of convolutional codes with a designed free distance is introduced. This new class of codes has many characteristics of BCH block codes, therefore we call...
Zero Assignment, Pole Placement and Matrix Extension Problems: A Common Point of View (1999)
Meeyoung Kim, Joachim Rosenthal, Xiaochang Alex Wang
The paper studies a general inverse eigenvalue problem which contains as special cases many well studied pole placement and matrix extension problems. It is shown that the studied problem corresponds...
A Matrix Euclidean Algorithm induced by State Space Realization (1999)
Brian M. Allen, Joachim Rosenthal
An efficient algorithm is developed for determining the greatest common left divisor (GCLD) of two polynomial matrices. Knowing this divisor allows for several immediate applications: In coding...
Open problems in the area of pole placement (1998)
Joachim Rosenthal, Jan C. Willems
In recent years there has been significant progress towards the solution of various versions of the pole placement problem. An important factor has been the behavioral theory which provided a...
Generalized First order Descriptions and Canonical Forms for Convolutional Codes (1998)
Roxana Smarandache, Heide Gluesing-Luerssen, Joachim Rosenthal
this paper we study one of these generalized first order representations and we work out in a direct way the minimality conditions as well as the uniqueness of the description.
An Algebraic Decoding Algorithm for Convolutional Codes (1998)
this article to introduce a new iterative algebraic decoding algorithm which is capable of decoding convolutional codes which have a certain underlying algebraic structure. The algorithm exploits the...
The Pole Placement Problem via PI Feedback Controllers. (1998)
John Leventides, Northhampton Square, X.A. Wang, Joachim Rosenthal, Xiaochang Alex Wang
In this paper we study the pole placement problem using generalized PI controllers of a fixed lag k as compensators. We derive a new strong sufficiency condition which guarantees the arbitrary pole...
Maximum Distance Separable Convolutional Codes (1998)
Joachim Rosenthal And, Joachim Rosenthal, Roxana Smarandache
. A maximum distance separable (MDS) block code is a linear code whose distance is maximal among all linear block codes of rate k=n. It is well known that MDS block codes do exist if the field size...
Some Remarks on Real and Complex Output Feedback (1998)
Joachim Rosenthal, Frank Sottile, Gamma F
. We provide some new necessary and sufficient conditions which guarantee arbitrary pole placement of a particular linear system over the complex numbers. We exhibit a non-trivial real linear system...
Open Problems in the Area of Pole Placement (1998)
Joachim Rosenthal, Jan C. Willems
Introduction The static and the dynamic output pole placement problem belong to the prominent design problems of modern control theory and we refer to the survey articles [4, 10, 19, 21] where also...
An Algebraic Decoding Algorithm for Convolutional Codes (1998)
this article to introduce a new iterative algebraic decoding algorithm which is capable of decoding convolutional codes which have a certain underlying algebraic structure. The algorithm exploits the...
Maximum Distance Separable Convolutional Codes (1998)
Joachim Rosenthal, Roxana Smarandache
. A maximum distance separable (MDS) block code is a linear code whose distance is maximal among all linear block codes of rate k=n. It is well known that MDS block codes do exist if the field size...
A Behavioral Approach to Singular Systems (1998)
Vakhtang Lomadze, M. S. Ravi, Joachim Rosenthal, J. M. Schumacher
The notion of behaviors introduced by Willems gives a good description of dynamical systems without reference to any particular representation of the system in terms of equations. In this note, we...
A State Space Approach for Constructing MDS Rate 1/n Convolutional Codes (1998)
Roxana Smarandache, Joachim Rosenthal
In this paper we provide a state space approach for constructing convolutional codes of rate 1=n and complexity ffi, whose free distance is n(ffi + 1), the maximal possible free distance. I....
BCH Convolutional Codes (1998)
Joachim Rosenthal, Eric V. York
Using a new parity check matrix, a class of convolutional codes with a designed free distance is introduced. This new class of codes has many characteristics of BCH block codes, therefore we call...
An Optimal Control Theory for Systems Defined Over Finite Rings (1998)
this article we do formulate the problem in terms of linear systems theory and we show that the posed question is connected to some classical problems of systems theory. A convolutional code can be...
Some Remarks on Real and Complex Output Feedback (1997)
Rosenthal, Joachim, Sottile, Frank
We provide some new necessary and sufficient conditions which guarantee arbitrary pole placement of a particular linear system over the complex numbers. We exhibit a non-trivial real linear system...
On the generalized hamming weights of convolutional codes (1997)
J. Rosenthal, E. V. York, Joachim Rosenthal, Eric Von York
and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of
BCH Convolutional Codes (1997)
Joachim Rosenthal, Eric V. York
Using a new parity check matrix a class of convolutional codes with a designed free distance is introduced. This new class of codes has many characteristics of BCH block codes, therefore we call...
The paper explains in a tutorial way some major research questions in the area of convolutional coding theory from a perspective of systems theory. We will show that those questions are related to...
On the Generalized Hamming Weights of Convolutional Codes (1997)
Joachim Rosenthal, Eric. V. York
Motivated by applications in cryptology, Wei introduced in 1991 the concept of a generalized Hamming weight for a linear block code. In this correspondence, we define generalized Hamming weights for...
Construction of Convolutional Codes using Methods from Linear Systems Theory (1997)
Joachim Rosenthal, Roxana Smarandache
Using two different matrix pencil descriptions two new classes of convolutional codes with designed lower free distance are introduced. Keywords: Convolutional codes, linear systems, generalized...
Eigenvalue Completions By Affine Varieties (1997)
Joachim Rosenthal, Xiaochang Wang
. In this paper we provide new necessary and sufficient conditions for a general class of eigenvalue completion problems. 1. Preliminaries Let F be an algebraically closed field of characteristic...
Output feedback pole placement with dynamic compensators (1996)
J. Rosenthal, Joachim Rosenthal, Xiaochang Alex Wang, Xiaochang Alex Wang
and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of
Output Feedback Pole Placement with Dynamic Compensators (1996)
Joachim Rosenthal, Senior Member, Xiaochang Alex Wang, Wang Member
| In this paper we derive a new rank condition which guarantees the arbitrary pole assignability of a given system by dynamic compensators of degree at most q. By using this rank condition we...
Dynamic Pole Assignment and Schubert Calculus (1996)
M. S. Ravi, Joachim Rosenthal, Xiaochang Wang
. The output feedback pole assignment problem is a classical problem in linear systems theory. In this paper we calculate the number of complex dynamic compensators of order q assigning a given set...
The Pole Placement Problem via PI Feedback Controllers. (1996)
John Leventides, Northhampton Square, X.A. Wang, Joachim Rosenthal, Xiaochang Alex Wang
In this paper we study the pole placement problem using generalized PI controllers as compensators. We derive a new sufficiency condition which guarantees the arbitrary pole assignability of a given...
On Behaviors and Convolutional Codes (1996)
Joachim Rosenthal, J.M. Schumacher, Eric V. York, Senior Member
It is well known that a convolutional code is essentially a linear system defined over a finite field. In this paper we elaborate on this connection. We will define convolutional codes as the dual of...
On behaviors and convolutional codes (1996)
Joachim Rosenthal, Senior Member, Eric V. York
Abstract—Using a new parity-check matrix, a class of convolutional codes with a designed free distance is introduced. This new class of codes has many characteristics of BCH block codes, therefore,...
On behaviors and convolutional codes (1996)
Joachim Rosenthal, Senior Member, J. M. Schumacher
Abstract-It is well known that a convolutional code is essen-tially a linear system defined over a finite field. In this paper we elaborate on this connection. We will define a convolutional code as...
Geometric methods for feedback stabilization of multivariable linear systems / (1990)
Thesis (Ph. D.)--Arizona State University, 1990.
Custodia und Aktivlegitimation zur actio furti. (1950)
Leipzig, Jur. F., Diss. v. 15. Dez. 1950 (Nicht f. d. Aust.).