Let P3q(or PG(3, q)) denote the protective space of dimension 3 over a finite field Fq. A class of codes has been constructed from curves of complete intersection in Pq3. Parameters, generators and parity-check matric...Let P3q(or PG(3, q)) denote the protective space of dimension 3 over a finite field Fq. A class of codes has been constructed from curves of complete intersection in Pq3. Parameters, generators and parity-check matrices are given. Another result is that a decoding algorithm turns out to be a generalization of the algorithm for decoding plane algebraic curve codes. The proposed algorithm has a complexity 0(n4), where ?is the length of the codes.展开更多
文摘Let P3q(or PG(3, q)) denote the protective space of dimension 3 over a finite field Fq. A class of codes has been constructed from curves of complete intersection in Pq3. Parameters, generators and parity-check matrices are given. Another result is that a decoding algorithm turns out to be a generalization of the algorithm for decoding plane algebraic curve codes. The proposed algorithm has a complexity 0(n4), where ?is the length of the codes.
