<p>An optimal representation constitutes an efficient set. It is known that for an aggregating system if the cost of representation increases linearly with the number of bases, ternary coding is superior to binary, and coding in <i>e</i> is optimal. This paper investigates the relative efficiency of bases for the cases when the cost complexity is affine (slope–intercept linear), exponential, and logistic and presents new results. It is shown that for representation of structure in logistic maps, which applies often to biological systems and is true for input–output maps of neurons, the optimal base value is near 1.7632, which is consistent with the unary and space coding of information in songbirds. It is shown that the mathematical basis of this result is the solution to the equation <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="12064_2025_444_Article_IEq1.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="49" /> </InlineMediaObject> <EquationSource Format="TEX">\({b}^{b}=e.\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msup> <mrow> <mi>b</mi> </mrow> <mi>b</mi> </msup> <mo>=</mo> <mi>e</mi> <mo>.</mo> </mrow> </math></EquationSource> </InlineEquation></p>