Two-dimensional (2D) finite codes are defined as families of compact support sequences indexed in Z × Z and taking values in F n , F a Galois field. Several properties of encoders, decoders and syndrome decoders are discussed under different hypotheses on the code structure, and related to the injectivity and primeness of the corresponding polynomial matrices in two variables. Dual codes are finally introduced as families of parity checks on a given modular code, and related to the standard theory of 2D behaviors.

On 2D finite support convolutional codes: an algebraic approach

FORNASINI, ETTORE;VALCHER, MARIA ELENA
1994

Abstract

Two-dimensional (2D) finite codes are defined as families of compact support sequences indexed in Z × Z and taking values in F n , F a Galois field. Several properties of encoders, decoders and syndrome decoders are discussed under different hypotheses on the code structure, and related to the injectivity and primeness of the corresponding polynomial matrices in two variables. Dual codes are finally introduced as families of parity checks on a given modular code, and related to the standard theory of 2D behaviors.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11577/103535
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 23
  • ???jsp.display-item.citation.isi??? ND
social impact