All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 5 Next

Displaying 81 – 100 of 261

Showing per page

Exploring invariant linear codes through generators and centralizers

Partha Pratim Dey (2005)

Archivum Mathematicum

We investigate a H -invariant linear code C over the finite field F p where H is a group of linear transformations. We show that if H is a noncyclic abelian group and ( | H | , p ) = 1 , then the code C is the sum of the centralizer codes C c ( h ) where h is a nonidentity element of H . Moreover if A is subgroup of H such that A ≅ Z q × Z q , q ≠ p , then dim  C is known when the dimension of C c ( K ) is known for each subgroup K ≠ 1 of A . In the last few sections we restrict our scope of investigation to a special class of invariant codes, namely affine...

Hierarchical models, marginal polytopes, and linear codes

Thomas Kahle, Walter Wenzel, Nihat Ay (2009)

Kybernetika

In this paper, we explore a connection between binary hierarchical models, their marginal polytopes, and codeword polytopes, the convex hulls of linear codes. The class of linear codes that are realizable by hierarchical models is determined. We classify all full dimensional polytopes with the property that their vertices form a linear code and give an algorithm that determines them.

Currently displaying 81 – 100 of 261