Weekend Programming Challenge – Week #31 Run Length Encoder/Decoder


Image

Problem:

RLE/D is the simplest way to compress data http://en.wikipedia.org/wiki/Run-length_encoding
Implement RLE/D in shortest/simplest way possible using your favourite language.

The rules:

You can code the solution in any programming language during the weekend and have to submit it to info@olimex.com latest on Sunday November 3rd.

On Monday we will upload the solutions on GitHub https://github.com/OLIMEX/WPC

You can play with your real name or with nick if you want to be anonymous, we will not disclosure your personal info if you do not want to.

10 Comments (+add yours?)

  1. Michael Paul Coder
    Nov 02, 2013 @ 05:57:29

    This is one step away from writing a fingerprint identification algorithm. Elite.

    Reply

  2. Hans Franke
    Nov 02, 2013 @ 19:44:43

    Fingerprint encoding is in fact less work.

    But back for the WPC – what’s the input, and what’s is the output expected?

    Reply

  3. Hans Franke
    Nov 03, 2013 @ 01:30:39

    And this is supposed to mean what?

    Serious, I can come up with like a dozend or more ways of valid encodings just for the little black and white house. But without defining some setup, this challenge is worthless.

    Reply

    • Hans Franke
      Nov 03, 2013 @ 01:35:59

      To be more exact: Are we about to RLE ASCII Text, or B&W Bitmap, or 8 Bit indexed, oder RGB (3×8 or 3×24 or 4×16 or what) or maybe some data structures?

      All of this (and many more) will require different kinds of codecs. Without a clear definition of the task to be completed, it’s more of a bad joke, then a competition.

      So please Olimex, stand up to your reputation and do a better job.

      Reply

      • OLIMEX Ltd
        Nov 03, 2013 @ 08:39:26

        Hans this is not competition, but challenge without restrictions what and how to be done. Eeveryone is free to implement whatever he wants and it’s more like sharing ideas how to solve problems using different approaches and tools/languages, so when results are published, people to may view other solutions and learn new stuff

  4. Hans Franke
    Nov 03, 2013 @ 13:39:34

    The motivation is clear, but either way, if you start a race, distance and finish needs to be named, or in our case, the problem to be solved needs be specified. There is no generalized RLE possible. It just says count sequences of equal items. So the items to be counted have to be named.

    Learing from other solutions implies that these solutions are about the same problem.

    Reply

  5. DrWheetos
    Nov 05, 2013 @ 00:27:35

    Oh my, a solution in 6502 assembler. That takes me back 20 years when it was my micro of choice for electronics projects. Built several rally trip computers using that or the 6510. Good memories…

    Reply

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: