Notes on "Symmetric Bases with large 2-range"

2014/09/22 by Michael Farinton Challis, Challis, Michael Farinton
Computer Science · Engineering · #Coding theory and cryptography #Combinatorics (math.CO) #Cryptography and Residue Arithmetic #FOS: Mathematics #Number Theory (math.NT) #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1409.6266

openalex publication_date 2014/09/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

A_k = 1, a₂, ... a_k is an h-basis for n if every positive integer not exceeding n can be expressed as the sum of no more than h values a_i. An extremal h-basis A_k is one for which n is as large as possible. Computing extremal bases has become known as the Postage Stamp Problem. This paper is inspired by and based upon a paper entitled "Symmetric bases with large 2-range for k<=75" by Svein Mossige at the University of Bergen (Mossige, Svein, [4]). Computer searches have identified some further bases which are superior to those reported in [4], and the paper also reports an improvement to one of the theoretical results.

Related

• Notes on Symmetric Bases
• Looking for good Hofmeister and Braunschadel bases
• The Postage Stamp Problem - Formulae and proof for the case of 3 denominations
• A note on m_h(A_k)
• A proof that h₁, h₂ <= h₀ for any h-basis A₃