Optimization of Generalized Unary Coding (1611.03353v1)

Published 31 Oct 2016 in cs.DM

Abstract: This paper proposes an optimum version of the recently advanced scheme for generalized unary coding. In this method, the block of 1s that identifies the number is allowed to be broken up, which extends the count. The result is established by a theorem. The number count is now n(n-k-1)+1 rather than the previously described (n-k)(n-k)-1.

Abstract PDF Chat (Pro)

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Generate a whiteboard explanation of this paper.

Sign Up to Generate

Paper to Video (Beta)

Generate a video overview of this paper.

Sign Up to Generate

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Top Community Prompts

Explain it Like I'm 14

Practical Applications

Conceptual Simplification

Sign Up to Activate View All Prompts

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Rakshitha Ravula

Collections

Sign up for free to add this paper to one or more collections.