A NEW HYBRID ALGORITHM FOR COMPUTING A FAST DISCRETE FOURIER TRANSFORMREED IS; TRUONG TK.1979; I.E.E.E. TRANS. COMPUTERS; USA; DA. 1979; VOL. 28; NO 7; PP. 488-492; BIBL. 21 REF.Article

A FAST D.F.T. ALGORITHM USING COMPLEX INTEGER TRANSFORMS.REED IS; TRUONG TK.1978; ELECTRON. LETTERS; G.B.; DA. 1978; VOL. 14; NO 6; PP. 191-193; BIBL. 12 REF.Article

THE USE OF FINITE FIELDS TO COMPUTE CONVOLUTIONS.REED IS; TRUONG TK.1975; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1975; VOL. 21; NO 2; PP. 208-213; BIBL. 6 REF.Article

SIMPLE PROOF OF THE CONTINUED FRACTION ALGORITHM FOR DECODING REED-SALOMON CODESREED IS; TRUONG TK.1978; PROC. INSTIT. ELECTR. ENGRS; GBR; DA. 1978; VOL. 125; NO 12; PP. 1318-1320; BIBL. 4 REF.Article

NEW SYNDROME DECODER FOR (N, 1) CONVOLUTIONAL CODESREED IS; TRUONG TK.1983; ELECTRONICS LETTERS; ISSN 0013-5194; GBR; DA. 1983; VOL. 19; NO 9; PP. 344-346; BIBL. 5 REF.Article

FAST MERSENNE-PRIME TRANSFORMS FOR DIGITAL FILTERING.REED IS; TRUONG TK.1978; PROC. INSTIT. ELECTR. ENGRS; GBR; DA. 1978; VOL. 125; NO 5; PP. 433-440; BIBL. 18 REF.Article

A FAST COMPUTATION OF COMPLEX CONVOLUTION USING A HYBRID TRANSFORM = CALCUL RAPIDE DE LA CONVOLUTION COMPLEXE A L'AIDE D'UNE TRANSFORMEE HYBRIDEREED IS; TRUONG TK.1978; I.E.E.E. TRANS. ACOUST. SPEECH SIGNAL PROCESSG; USA; DA. 1978; VOL. 26; NO 6; PP. 566-570; BIBL. 15 REF.Article

COMPLEX INTEGER CONVOLUTIONS OVER A DIRECT SUM OF GALOIS FIELDS.REED IS; TRUONG TK.1975; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1975; VOL. 21; NO 6; PP. 657-661; BIBL. 10 REF.Article

A GENERALIZED (W) FILTER FOR 3-D RECONSTRUCTION.KWOH YS; REED IS; TRUONG TK et al.1977; I.E.E.E. TRANS. NUCL. SCI.; U.S.A.; DA. 1977; VOL. 24; NO 5; PP. 1990-1998; BIBL. 6 REF.Article

DECODING OF B.C.H. AND R.S. CODES WITH ERRORS AND ERASURES USING CONTINUED FRACTIONSREED IS; TRUONG TK; MILLER RL et al.1979; ELECTRON. LETTERS; GBR; DA. 1979; VOL. 15; NO 17; PP. 542-544; BIBL. 3 REF.Article

A PARALLEL-PIPELINE ARCHITECTURE OF THE FAST POLYNOMIAL TRANSFORM FOR COMPUTING A TWO-DIMENSIONAL CYCLIC CONVOLUTIONTRUONG TK; LIU KY; REED IS et al.1983; IEEE TRANSACTIONS ON COMPUTERS; ISSN 0018-9340; USA; DA. 1983; VOL. 32; NO 3; PP. 301-306; BIBL. 12 REF.Article

FAST ALGORITHM FOR COMPUTING COMPLEX NUMBER-THEORETIC TRANSFORMS.REED IS; LIU KY; TRUONG TK et al.1977; ELECTRON. LETTERS; G.B.; DA. 1977; VOL. 13; NO 10; PP. 278-280; BIBL. 15 REF.Article

FAST POLYNOMINAL TRANSFORM AND ITS IMPLEMENTATION BY COMPUTERREED IS; SHAO HM; TRUONG TK et al.1981; IEE PROC., PART E; ISSN 0143-7062; GBR; DA. 1981; VOL. 128; NO 2; PP. 50-60; BIBL. 14 REF.Article

FAST MERSENNE-PRIME TRANSFORMS FOR DIGITAL FILTERS = TRANSFORMATIONS PREMIERES RAPIDES DE MERSENNE POUR FILTRES NUMERIQUESMILLER RL; REED IS; TRUONG TK et al.1979; PROC. INSTIT. ELECTR. ENGRS; GBR; DA. 1979; VOL. 126; NO 2; PP. 203; BIBL. 2 REF.Article

SIMPLIFIED ALGORITHM FOR CORRECTING BOTH ERRORS AND ERASURES OF REED-SOLOMON CODESREED IS; TRUONG TK; MILLER RL et al.1979; PROC. I.E.E.; ISSN 0020-3270; GBR; DA. 1979; VOL. 126; NO 10; PP. 961-963; BIBL. 10 REF.Article

THE FAST DECODING OF REED-SOLOMON CODES USING FERMAT TRANSFORMSREED IS; TRUONG TK; WELCH LR et al.1978; I.E.E.E. TRANS. INFORM. THEORY; USA; DA. 1978; VOL. 24; NO 4; PP. 497-499; BIBL. 16 REF.Article

A THEOREM FOR COMPUTING PRIMITIVE ELEMENTS IN THE FIELD OF COMPLEX INTEGERS OF A CHARACTERISTIC MERSENNE PRIMEMILLER RL; REED IS; TRUONG TK et al.1981; IEEE TRANS. ACOUST. SPEECH SIGNAL PROCESS.; ISSN 0096-3518; USA; DA. 1981; VOL. 29; NO 1; PP. 119-120; BIBL. 9 REF.Article

EFFICIENT PROGRAM FOR DECODING THE (255, 223) REED-SOLOMON CODE OVER GF (2⁸) WITH BOTH ERRORS AND ERASURES, USING TRANSFORM DECODINGMILLER RL; TRUONG TK; REED IS et al.1980; IEE PROC., PART E; ISSN 0143-7062; GBR; DA. 1980; VOL. 127; NO 4; PP. 136-142; BIBL. 9 REF.Article

SIMPLE METHOD FOR COMPUTING ELEMENTS OF ORDER 2^KN, WHERE N!2^P-1-1 AND 2 <OU= K <OU= P+1, IN GF ((2^P-1)²)REED IS; TRUONG TK; MILLER RL et al.1978; ELECTRON. LETTERS; GBR; DA. 1978; VOL. 14; NO 21; PP. 697-698; BIBL. 13 REF.Article

INTEGER CONVOLUTIONS OVER THE FINITE FIELD GF(3.2^N+1).GOLOMB SW; REED IS; TRUONG TK et al.1977; S.I.A.M. J. APPL. MATH.; U.S.A.; DA. 1977; VOL. 32; NO 2; PP. 356-365; BIBL. 12 REF.Article

FAST ALGORITHM FOR ENCODING THE (255, 223) REED-SOLOMON CODE OVER GF (28)MILLER RL; TRUONG TK; REED IS et al.1980; ELECTRON. LETTERS; GBR; DA. 1980; VOL. 16; NO 6; PP. 222-223; BIBL. 2 REF.Article

FAST TECHNIQUE FOR COMPUTING SYNDROMES OF B.C.H. AND REED-SOLOMON CODESTRUONG TK; MILLER RL; REED IS et al.1979; ELECTRON. LETTERS; GBR; DA. 1979; VOL. 15; NO 22; PP. 720-721; BIBL. 5 REF.Article

BACK PROJECTION SPEED IMPROVEMENT FOR 3-D-RECONSTRUCTION.KWOH YS; REED IS; TRUONG TK et al.1977; I.E.E.E. TRANS. NUCL. SCI.; U.S.A.; DA. 1977; VOL. 24; NO 5; PP. 1999-2005; BIBL. 5 REF.Article

FAST-NUMBER-THORETIC TRANSFORMS FOR DIGITAL FILTERING.LIU KY; REED IS; TRUONG TK et al.1976; ELECTRON. LETTERS; G.B.; DA. 1976; VOL. 12; NO 24; PP. 644-646; BIBL. 16 REF.Article

ON THE APPLICATION OF A FAST POLYNOMIAL TRANSFORM AND THE CHINESE REMAINDER THEOREM TO COMPUTE A TWO-DIMENSIONAL CONVOLUTIONTRUONG TK; REED IS; LIPES RG et al.1981; IEEE TRANS. ACOUST. SPEECH SIGNAL PROCESS; ISSN 0096-3518; USA; DA. 1981; VOL. 29; NO 1; PP. 91-97; BIBL. 13 REF.Article