DFT for cyclic code overF p +uF p + ··· +u k-1 F p

descriptionPublicationkeyboard_double_arrow_right Article 01 Sep 2006 English Publisher:Springer Science and Business Media LLCJournal:Journal of Applied Mathematics and Computing, volume 22, pages 159-167 (issn: 1598-5865, eissn: 1865-2085,

Copyright policy )

Authors: Jianfa Qian; Lina Zhang; Shixin Zhu;

doi: 10.1007/bf02896468

DFT for cyclic code overF p +uF p + ··· +u k-1 F p

- Summary
- Metrics

Abstract

The transform domain characterization of cyclic codes over finite fields using Discrete Fourier Transform(DFT) over an appropriate extension field is well known. In this paper, we extend this transform domain characterization for cyclic codes overF p +uF p + ··· +u k-1 F p . We give a way to characterize cyclic codes overF p +uF p + ··· +u k-1 F p by Mattson-Solomon polynomials and multiple defining sets.

Related Organizations

Anhui University of Science and Technology
China (People's Republic of)
Hefei University of Technology
China (People's Republic of)

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	3
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average