AAAAAA

   
Results: 1-14 |
Results: 14
MODELING BURST CHANNELS USING PARTITIONED FRITCHMANS MARKOV-MODELS
Authors: PIMENTEL C BLAKE IF
Citation: C. Pimentel et If. Blake, MODELING BURST CHANNELS USING PARTITIONED FRITCHMANS MARKOV-MODELS, IEEE transactions on vehicular technology, 47(3), 1998, pp. 885-899
TRELLIS COMPLEXITY AND MINIMAL TRELLIS DIAGRAMS OF LATTICES
Authors: BANIHASHEMI AH BLAKE IF
Citation: Ah. Banihashemi et If. Blake, TRELLIS COMPLEXITY AND MINIMAL TRELLIS DIAGRAMS OF LATTICES, IEEE transactions on information theory, 44(5), 1998, pp. 1829-1847
UPPER BOUND FOR UNIQUELY DECODABLE CODES IN A BINARY INPUT N-USER ADDER CHANNEL
Authors: BROSS SI BLAKE IF
Citation: Si. Bross et If. Blake, UPPER BOUND FOR UNIQUELY DECODABLE CODES IN A BINARY INPUT N-USER ADDER CHANNEL, IEEE transactions on information theory, 44(1), 1998, pp. 334-340
NEW LOW-COMPLEXITY BIT-PARALLEL FINITE-FIELD MULTIPLIERS USING WEAKLYDUAL BASES
Authors: WU HP HASAN MA BLAKE IF
Citation: Hp. Wu et al., NEW LOW-COMPLEXITY BIT-PARALLEL FINITE-FIELD MULTIPLIERS USING WEAKLYDUAL BASES, I.E.E.E. transactions on computers, 47(11), 1998, pp. 1223-1234
SPECIFIC IRREDUCIBLE POLYNOMIALS WITH LINEARLY INDEPENDENT ROOTS OVERFINITE-FIELDS
Authors: BLAKE IF GAO SH MULLIN RC
Citation: If. Blake et al., SPECIFIC IRREDUCIBLE POLYNOMIALS WITH LINEARLY INDEPENDENT ROOTS OVERFINITE-FIELDS, Linear algebra and its applications, 253, 1997, pp. 227-249
NORMAL BASIS OF THE FINITE-FIELD F(2(P-1)PM) OVER F2
Authors: WANG MZ BLAKE IF
Citation: Mz. Wang et If. Blake, NORMAL BASIS OF THE FINITE-FIELD F(2(P-1)PM) OVER F2, IEEE transactions on information theory, 43(2), 1997, pp. 737-739
ON THE PERFORMANCE OF FRACTAL COMPRESSION WITH CLUSTERING
Authors: WEIN CJ BLAKE IF
Citation: Cj. Wein et If. Blake, ON THE PERFORMANCE OF FRACTAL COMPRESSION WITH CLUSTERING, IEEE transactions on image processing, 5(3), 1996, pp. 522-526
ON THE TRELLIS COMPLEXITY OF THE DENSEST LATTICE PACKINGS IN R(N)
Authors: BLAKE IF TAROKH V
Citation: If. Blake et V. Tarokh, ON THE TRELLIS COMPLEXITY OF THE DENSEST LATTICE PACKINGS IN R(N), SIAM journal on discrete mathematics, 9(4), 1996, pp. 597-601
TRELLIS COMPLEXITY VERSUS THE CODING GAIN OF LATTICES .1.
Authors: TAROKH V BLAKE IF
Citation: V. Tarokh et If. Blake, TRELLIS COMPLEXITY VERSUS THE CODING GAIN OF LATTICES .1., IEEE transactions on information theory, 42(6), 1996, pp. 1796-1807
TRELLIS COMPLEXITY VERSUS THE CODING GAIN OF LATTICES .2.
Authors: TAROKH V BLAKE IF
Citation: V. Tarokh et If. Blake, TRELLIS COMPLEXITY VERSUS THE CODING GAIN OF LATTICES .2., IEEE transactions on information theory, 42(6), 1996, pp. 1808-1816
FAST PARALLEL ALGORITHMS FOR DECODING REED-SOLOMON CODES BASED ON REMAINDER POLYNOMIALS
Authors: DABIRI D BLAKE IF
Citation: D. Dabiri et If. Blake, FAST PARALLEL ALGORITHMS FOR DECODING REED-SOLOMON CODES BASED ON REMAINDER POLYNOMIALS, IEEE transactions on information theory, 41(4), 1995, pp. 873-885
NORMAL AND SELF-DUAL NORMAL BASES FROM FACTORIZATION OF CXQ-AX-B(1+DXQ)
Authors: BLAKE IF GAO SH MULLIN RC
Citation: If. Blake et al., NORMAL AND SELF-DUAL NORMAL BASES FROM FACTORIZATION OF CXQ-AX-B(1+DXQ), SIAM journal on discrete mathematics, 7(3), 1994, pp. 499-512
THE CAPACITY FOR A DISCRETE-STATE CODE-DIVISION MULTIPLE-ACCESS CHANNEL
Authors: ALENCAR MS BLAKE IF
Citation: Ms. Alencar et If. Blake, THE CAPACITY FOR A DISCRETE-STATE CODE-DIVISION MULTIPLE-ACCESS CHANNEL, IEEE journal on selected areas in communications, 12(5), 1994, pp. 925-937
DETECTION IN MULTIVARIATE NON-GAUSSIAN NOISE
Authors: WONG BCY BLAKE IF
Citation: Bcy. Wong et If. Blake, DETECTION IN MULTIVARIATE NON-GAUSSIAN NOISE, IEEE transactions on communications, 42(2-4), 1994, pp. 1672-1683
Risultati: 1-14 |