The following pages link to Hari Krishna (Q579214):
Displaying 16 items.
- Computational complexity of bilinear forms. Algebraic coding theory and applications to digital communication systems (Q579215) (← links)
- Fast algorithms for erasures and error correction in redundant residue number systems (Q1312200) (← links)
- On reduced polynomial-based split algorithms (Q1320122) (← links)
- A mathematical framework for algorithm-based fault-tolerant computing over a ring of integers (Q1341142) (← links)
- On a signal processing algorithms based class of linear codes (Q1803557) (← links)
- An FFT algorithm based fast algorithm for arbitrary polynomial transformation (Q3034787) (← links)
- The Split Levinson Algorithm is Weakly Stable (Q3142641) (← links)
- Fast O(n) complexity algorithms for diagonal innovation matrices (Q3698157) (← links)
- Computationally efficient stepup and stepdown procedures for real predictor coefficients (Q3807960) (← links)
- Computational aspects of the bilinear transformation based algorithm for S-plane to Z-plane mapping (Q3809643) (← links)
- A coding theory approach to error control in redundant residue number systems. I. Theory and single error correction (Q4005153) (← links)
- A coding theory approach to error control in redundant residue number systems. II. Multiple error detection and correction (Q4005154) (← links)
- (Q4041050) (← links)
- Computationally Efficient Reduced Polynomial Based Algorithms for Hermitian Toeplitz Matrices (Q4729243) (← links)
- (Q4883476) (← links)
- On theory and fast algorithms for error correction in residue number system product codes (Q5375323) (← links)
