메뉴 건너뛰기




Volumn 42, Issue 2, 2006, Pages 139-151

A method for computation of the discrete Fourier transform over a finite field

Author keywords

[No Author keywords available]

Indexed keywords

BINARY CODES; BLOCK CODES; COMPUTATION THEORY; DISCRETE FOURIER TRANSFORMS; MATRIX ALGEBRA; SIGNAL ENCODING;

EID: 33745850458     PISSN: 00329460     EISSN: 16083253     Source Type: Journal    
DOI: 10.1134/S0032946006020074     Document Type: Article
Times cited : (24)

References (10)
  • 1
    • 0023994946 scopus 로고
    • A Fast Algorithm for the Fourier Transform over Finite Fields and Its VLSI Implementation
    • Wang, Y. and Zhu, X., A Fast Algorithm for the Fourier Transform over Finite Fields and Its VLSI Implementation, IEEE J. Select. Areas Commun., 1988, vol. 6, no. 3, pp. 572-577.
    • (1988) IEEE J. Select. Areas Commun. , vol.6 , Issue.3 , pp. 572-577
    • Wang, Y.1    Zhu, X.2
  • 3
    • 0242494250 scopus 로고    scopus 로고
    • A Method for Fast Computation of the Fourier Transform over a Finite Field
    • [Probl. Inf. Trans. (Engl. Transl.), 2003, vol. 39, no. 3, pp. 231-238]
    • Trifonov, P.V. and Fedorenko, S.V., A Method for Fast Computation of the Fourier Transform over a Finite Field, Probl. Peredachi Inf., 2003, vol. 39, no. 3, pp. 3-10 [Probl. Inf. Trans. (Engl. Transl.), 2003, vol. 39, no. 3, pp. 231-238].
    • (2003) Probl. Peredachi Inf. , vol.39 , Issue.3 , pp. 3-10
    • Trifonov, P.V.1    Fedorenko, S.V.2
  • 4
    • 0001249667 scopus 로고
    • Discrete Fourier Transforms when the Number of Data Samples Is Prime
    • Rader, C.M., Discrete Fourier Transforms when the Number of Data Samples Is Prime, Proc. IEEE, 1968, vol. 56, no. 6, pp. 1107-1108.
    • (1968) Proc. IEEE , vol.56 , Issue.6 , pp. 1107-1108
    • Rader, C.M.1
  • 5
    • 0003517783 scopus 로고
    • Reading: Addison-Wesley, Translated under the title Teoriya i praktika kodov, kontroliruyushchikh oshibki, Moscow: Mir, 1986
    • Blahut, R.E., Theory and Practice of Error Control Codes, Reading: Addison-Wesley, 1983. Translated under the title Teoriya i praktika kodov, kontroliruyushchikh oshibki, Moscow: Mir, 1986.
    • (1983) Theory and Practice of Error Control Codes
    • Blahut, R.E.1
  • 6
    • 33745810335 scopus 로고    scopus 로고
    • Private communication
    • Bassalygo, L.A., private communication, 2003.
    • (2003)
    • Bassalygo, L.A.1
  • 7
    • 0007046585 scopus 로고
    • Moscow: Nauka, 4th ed. Translated under the title The Theory of Matrices, 2 vols., Providence: AMS Chelsea, 1998
    • Gantmakher, F.R., Teoriya matrits, Moscow: Nauka, 1988, 4th ed. Translated under the title The Theory of Matrices, 2 vols., Providence: AMS Chelsea, 1998.
    • (1988) Teoriya Matrits
    • Gantmakher, F.R.1
  • 8
    • 0003569605 scopus 로고
    • Reading: Addison-Wesley, Translated under the title Bystrye algoritmy tsifrovoi obrabotki signalov, Moscow: Mir, 1989
    • Blahut, R.E., Fast Algorithms for Digital Signal Processing, Reading: Addison-Wesley, 1985. Translated under the title Bystrye algoritmy tsifrovoi obrabotki signalov, Moscow: Mir, 1989.
    • (1985) Fast Algorithms for Digital Signal Processing
    • Blahut, R.E.1
  • 9
    • 0003956960 scopus 로고
    • Berlin: Springer, 8 ed. Translated under the title Algebra, Moscow: Nauka, 1976
    • van der Waerden, B.L., Algebra, Berlin: Springer, 1971, 8 ed. Translated under the title Algebra, Moscow: Nauka, 1976.
    • (1971) Algebra
    • van der Waerden, B.L.1
  • 10
    • 4043111301 scopus 로고    scopus 로고
    • On Computing the Syndrome Polynomial in Reed-Solomon Decoder
    • Costa, E., Fedorenko, S.V., and Trifonov, P.V., On Computing the Syndrome Polynomial in Reed-Solomon Decoder, Eur. Trans. Telecommun., 2004, vol. 15, no. 4, pp. 337-342.
    • (2004) Eur. Trans. Telecommun. , vol.15 , Issue.4 , pp. 337-342
    • Costa, E.1    Fedorenko, S.V.2    Trifonov, P.V.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.