RUS  ENG
Full version
JOURNALS // Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography] // Archive

Mat. Vopr. Kriptogr., 2013 Volume 4, Issue 4, Pages 65–75 (Mi mvk100)

This article is cited in 2 papers

Four infinite series of $k$-configurations

F. M. Malyshev

Steklov Mathematical Institute of RAS, Moscow

Abstract: We suggest an approach to the construction of $k$-configurations on the countable (or finite) set $X$. If $X$ is finite then $k$-configuration is a family of subsets in $X$ with the incidence matrix $L\in GL(|X|,2)$ such that $L$ and $L^{-1}$ have exactly $k$ ones in all rows and columns.

Key words: configuration, Boolean matrices, hypergraphs, digraphs.

UDC: 519.142.1

Received 22.IV.2013

DOI: 10.4213/mvk100



© Steklov Math. Inst. of RAS, 2024