This is code believe it or not

[crash_sid]

though i think that the solution i got is wrong still i'ld like to show what my results are:-
first count the geometrical patterns in the code(excluding the {} braces) i.e. for each straight or curved line count 1,for each dot 1,for each circle 1....and add them up..
hence {\|:.0} or {uu0000} or {w10} are all equal to 6 (e.g. w has got 4 lines +1 is one line+0 is one more curve = total of 6) .let this number be x
upto here i'm quite sure that i'm right,now the uncertain part follows..
remove all the vowels from the alphabet which lefts us with..

B C D F G H J K L M N P Q R S T V W X Y Z

now leave out the first x letters from the alphabet and the first letter that u get after striking out x letters is your decrypted letter.(Hence x=6 fetches us J andx=1 fetches C)

so the answer is GHJMK (now you can see why i'm not sure about my answer)

This model goes well with all the samples provided,if it wrong than its probably because you haven't provided more samples.

[Dredric1]

though i think that the solution i got is wrong still i'ld like to show what my results are:-
first count the geometrical patterns in the code(excluding the {} braces) i.e. for each straight or curved line count 1,for each dot 1,for each circle 1....and add them up..
hence {\|:.0} or {uu0000} or {w10} are all equal to 6 (e.g. w has got 4 lines +1 is one line+0 is one more curve = total of 6) .let this number be x
upto here i'm quite sure that i'm right,now the uncertain part follows..
remove all the vowels from the alphabet which lefts us with..

B C D F G H J K L M N P Q R S T V W X Y Z

now leave out the first x letters from the alphabet and the first letter that u get after striking out x letters is your decrypted letter.(Hence x=6 fetches us J andx=1 fetches C)

so the answer is GHJMK (now you can see why i'm not sure about my answer)

This model goes well with all the samples provided,if it wrong than its probably because you haven't provided more samples.

You are so close
but you made it to complex

[insider067]

i see HIJMK
What's that? Where's the connection with geometry?

[crash_sid]

though i think that the solution i got is wrong still i'ld like to show what my results are:-
first count the geometrical patterns in the code(excluding the {} braces) i.e. for each straight or curved line count 1,for each dot 1,for each circle 1....and add them up..
hence {\|:.0} or {uu0000} or {w10} are all equal to 6 (e.g. w has got 4 lines +1 is one line+0 is one more curve = total of 6) .let this number be x
upto here i'm quite sure that i'm right,now the uncertain part follows..
remove all the vowels from the alphabet which lefts us with..

B C D F G H J K L M N P Q R S T V W X Y Z

now leave out the first x letters from the alphabet and the first letter that u get after striking out x letters is your decrypted letter.(Hence x=6 fetches us J andx=1 fetches C)

so the answer is GHJMK (now you can see why i'm not sure about my answer)

This model goes well with all the samples provided,if it wrong than its probably because you haven't provided more samples.

You are so close
but you made it to complex

I'm not sure about the "complex" thing,its just lengthy.....and as for getting close is considered....i have already told you that the information you have provided is not mathematically sufficient to deduce any single model of the encryption...mine model is just one of many possibles which you can't refute on the basis of examples that you have provided.
So why don't give more examples..

[Dredric1]

here are more examples

{LL} = h
{OOII } = h
{ _=} = i
{= 0oo} = i
{ CcC } = i

-- Fri Mar 20, 2009 2:34 pm --

i see HIJMK
What's that? Where's the connection with geometry?

its counting you count patterns

its geometeric because these patterns are found in shapes

[crash_sid]

as far as the mapping of numbers into alphabets is considered,the examples you have given are redundant (effectively just to 4 examples)...the point is that whether u can work out the solutions from these examples uniquely from these 4 examples that you have provided assuming that u don't know the solution(u can assign each alphabet a number without any mathematical pattern and i won't be able to guess the solution unless i have near infinite amount of examples or atleast 25 different examles if its one to one linear mapping)....so now that the crux of your problem(thats counting patterns) have been solved i won't be wasting(no offence meant) my time on solving it further unless you give a set of unambigous deterministic set of examples...

[Dredric1]

here is part of the solution to these

you count the pattern and
then take that number and put in this key

1 = a
2 = b
3 = c
etc.

{LL} = 8 = h
{OOII } = 8 = h
{ _=} = 9 = i
{= 0oo} = 9 = i
{ CcC } = 9 = i

[demonicshadows3000]

well the numbers for the letters are
9 9 15 12 12 12 15
I I O L L L O

but what do the . ( and - mean?

also, i dont quite see how OOII is 8, since its then 15,15,9,9 so if i subtract the 15's from the 9's its 12 not 8

please give us another hint or explain how this works, it looks awesome ^^

[Dredric1]

{ O } consists of one line a circular line so it is equal to = 1
{ ( } cnosists of one line a cuved one and has two ends so it is = 3

[syncmaster1990]

wath do u say about this one?

txzx2xz3x4xzxhxz2zxxxxix3zxsxzx4xz2xzx/x3zxsxzx4zxixzx2xtxz3xxzxezx/xzx2x4zx3xzx2xz4xzx2x3zxixzx4xz2xzxsxzx3x3xzx/xz4xzxcxz3xzx2xzox3xzxoxz4xzx3x2xzlxzx3xzx/zx4x4xz2xzx3xzx3zx4x

encrypted Manuali