A recursive definition of \(p\)-ary addition without carry

DOI10.5802/jtnb.252zbMath0997.11013OpenAlexW2317286346MaRDI QIDQ1975044

François Laubie

Publication date: 3 April 2000

Published in: Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=JTNB_1999__11_2_307_0

zbMATH Keywords

\(p\)-ary representations of integers

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Other combinatorial number theory (11B75) Radix representation; digital problems (11A63)

Related Items (1)

On \(\mathbf{On}_p\)

Cites Work

• \(N\)-person Nim and \(N\)-person Moore's games
• Sumsets in vector spaces over finite fields
• Lexicographic codes: Error-correcting codes from game theory
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A recursive definition of \(p\)-ary addition without carry