The following pages link to Sergei V. Avgustinovich (Q1385208):
Displayed 31 items.
- Sequences of low arithmetical complexity (Q3423138) (← links)
- Canonical Decomposition of a Regular Factorial Language (Q3434678) (← links)
- Testing sets for 1-perfect codes (Q3439253) (← links)
- Canonical Representatives of Morphic Permutations (Q3449357) (← links)
- Perfect 2-Colorings of Johnson Graphs J(6,3) and J(7,3) (Q3540916) (← links)
- (Q3545581) (← links)
- Embedding in a perfect code (Q3578151) (← links)
- On the Number of $1$-Perfect Binary Codes: A Lower Bound (Q3604528) (← links)
- (Q3838664) (← links)
- (Q3838665) (← links)
- (Q3928244) (← links)
- (Q4242209) (← links)
- (Q4330626) (← links)
- (Q4500972) (← links)
- (Q4501019) (← links)
- Intersection matrices for partitions by binary perfect codes (Q4544601) (← links)
- (Q4664649) (← links)
- (Q4675484) (← links)
- A UNIQUE DECOMPOSITION THEOREM FOR FACTORIAL LANGUAGES (Q4680586) (← links)
- (Q4852852) (← links)
- (Q4866343) (← links)
- (Q4888928) (← links)
- Maximum intersection of linear codes and codes equivalent to linear (Q5090135) (← links)
- Computation complexity of a ternary linear function (Q5263770) (← links)
- (Q5488372) (← links)
- Testing Sets for 1-Perfect Code (Q5504236) (← links)
- On perfect colorings of paths divisible by a matching (Q5878610) (← links)
- Perfect binary \((n,3)\) codes: The structure of graphs of minimum distances (Q5954078) (← links)
- Singleton mesh patterns in multidimensional permutations (Q6071953) (← links)
- Distance Regular Colorings of $n$-Dimensional Rectangular Grid (Q6257584) (← links)
- On five types of crucial permutations with respect to monotone patterns (Q6403099) (← links)