On Parity-Preserving Constrained Coding

12/29/2019

∙

Necessary and sufficient conditions are presented for the existence of fixed-length parity-preserving encoders for a given constraint. It is also shown that under somewhat stronger conditions, the stethering method guarantees an encoder that has finite anticipation.

READ FULL TEXT

On Parity-Preserving Constrained Coding

On Parity-Preserving Variable-Length Constrained Coding

Necessary and Sufficient Girth Conditions for LDPC Tanner Graphs with Denser Protographs

Sylvester-type quaternion matrix equations with arbitrary equations and arbitrary unknowns

Categorical Buechi and Parity Conditions via Alternating Fixed Points of Functors

Approximation capabilities of measure-preserving neural networks

Structure-preserving diagonalization of matrices in indefinite inner product spaces

On the structure of C-algebras through atomicity and if-then-else

On Parity-Preserving Constrained Coding

Related Research

On Parity-Preserving Variable-Length Constrained Coding

Necessary and Sufficient Girth Conditions for LDPC Tanner Graphs with Denser Protographs

Sylvester-type quaternion matrix equations with arbitrary equations and arbitrary unknowns

Categorical Buechi and Parity Conditions via Alternating Fixed Points of Functors

Approximation capabilities of measure-preserving neural networks

Structure-preserving diagonalization of matrices in indefinite inner product spaces

On the structure of C-algebras through atomicity and if-then-else