The following pages link to (Q3317030):
Displaying 9 items.
- On Poincaré series for codes (Q1126542) (← links)
- Efficient coding of formalized messages (Q1816135) (← links)
- Algorithmic ways of deciding whether an infinite language is a code (Q1912449) (← links)
- On alphabetic coding for superwords (Q2190904) (← links)
- On bases of closed classes of Boolean vector functions (Q2209254) (← links)
- Algebra and probability (Q2871453) (← links)
- (Q4452139) (← links)
- A survey of progress in coding theory in the Soviet Union (Q5550268) (← links)
- Recoverable formal language (Q6173464) (← links)