Roulette games and depths of words over finite commutative rings
From MaRDI portal
Publication:831155
DOI10.1007/s10623-020-00838-4zbMath1470.91059OpenAlexW3124231677MaRDI QIDQ831155
Publication date: 10 May 2021
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-020-00838-4
Related Items (2)
Cites Work
- Unnamed Item
- Repeated-root constacyclic codes of prime power lengths over finite chain rings
- The depth spectrums of constacyclic codes over finite chain rings
- On the depth spectrum of binary linear codes and their dual
- The depth spectrum of negacyclic codes over \(\mathbb{Z}_4\)
- On the positional determinacy of edge-labeled games
- Rotating-table games and derivatives of words
- On units in loop algebra \(F[M(\mathrm{Dih}(C_p^2),2)\)]
- The Blind Bartender's Problem
- On the complexities of de-Bruijn sequences
- Permutation polynomials, de Bruijn sequences, and linear complexity
- On the depth spectrum of repeated-root constacyclic codes over finite chain rings
- On the depth distribution of linear codes
- Kerdock code in a cyclic form
- The Rotating Table
- A fast algorithm for determining the complexity of a binary sequence with period<tex>2^n</tex>(Corresp.)
- A linear construction for certain Kerdock and Preparata codes
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- The depth distribution-a new characterization for linear codes
- On the Structure and Distances of Repeated-Root Constacyclic Codes of Prime Power Lengths Over Finite Commutative Chain Rings
- Additional Winning Strategies in Reachability Games*†
- On integer-valued rational polynomials and depth distributions of binary codes
This page was built for publication: Roulette games and depths of words over finite commutative rings
