Return to Unfiction unforum
 a.r.g.b.b 
FAQ FAQ   Search Search 
 
Welcome!
New users, PLEASE read these forum guidelines. New posters, SEARCH before posting and read these rules before posting your killer new campaign. New players may also wish to peruse the ARG Player Tutorial.

All users must abide by the Terms of Service.
Website Restoration Project
This archiving project is a collaboration between Unfiction and Sean Stacey (SpaceBass), Brian Enigma (BrianEnigma), and Laura E. Hall (lehall) with
the Center for Immersive Arts.
Announcements
This is a static snapshot of the
Unfiction forums, as of
July 23, 2017.
This site is intended as an archive to chronicle the history of Alternate Reality Games.
  

The time now is Mon Nov 18, 2024 1:44 am
All times are UTC - 4 (DST in action)		 View posts in this forum since last visit
View unanswered posts in this forum
Calendar
 Forum index » Chaotic Fiction » Flynn Lives
[SOLVED] Next Puzzle: Flynn Lives Postcards
Moderators: enaxor, Euchre, spaceboy, thebruce
View previous topicView next topic
Page 46 of 69 [1032 Posts]   Goto page: Previous 1, 2, 3, ..., 44, 45, 46, 47, 48, ..., 67, 68, 69  Next
Author Message
Broklynite
Entrenched

Joined: 11 Apr 2009
Posts: 784
Distraction wrote:
ok...anyone care to test the theory? using the descriptions on the back of the card?
the only way this could work...is to put the descriptions side by said...any extra spaces could throw it off..

Astro Gunner says

Rocket your way through a deadly meteor shower
with agility, speed and the mightiest firepower in the
galaxy - Astro Gunner is out of this world!

can any one else post the other card descriptions? make sure you put it down exactly how it is on the card..


ARCWARS
Explosions abound in the breakneck space
chase! Dodge the enemy, explore new realms
and maneuver one behemoth vessel to the
outer reaches of your imagination, courtesy
of Encom.

Problem is that mine is fully justified. And if you don't have the same font, let alone justification, etc. then we may have some issues. Besides, mine is only 5 lines think (unless we could ARCWARS). Could be tricky.

PostPosted: Mon Jul 05, 2010 5:51 pm
 View user's profile
 Back to top 
Kajisan
Veteran

Joined: 28 Apr 2010
Posts: 72

 		what about the dots that are overlapping. is there a picture yet or the positions of these "special" dots on the grid? maybe nothing important..or the key to something

PostPosted: Mon Jul 05, 2010 5:52 pm
 View user's profile
 Back to top 
sowasred2012
Unfettered


Joined: 23 Oct 2007
Posts: 662
Location: London, UK

 		I for one vote we all relax on this for a couple of days - speculation is healthy, but we're going nuts trying to solve a puzzle for which I'm pretty sure we don't have all the pieces.

Comic Con is still a couple of weeks away, and the postcards/black light strips are clearly part of a primer for whatever is going to happen there. Game updates have previously happened on a Wednesday, so it would seem likely that the next breadcrumb will arrive this coming Wednesday.

Up to now, the clues and puzzles have been cracked within a day at most - the fact that we've been chipping away at this for the better part of a week now makes me think this is almost like another countdown (Zero Hour, Space Paranoids Online), except this time we can't see the clock.
_________________
Project Mason
Follow me on Twitter!

PostPosted: Mon Jul 05, 2010 5:56 pm
 View user's profile MSN Messenger
 Back to top 
Kajisan
Veteran

Joined: 28 Apr 2010
Posts: 72

 		VICE SQUAD

In 1982, Encom paid tribute to our brave men and women in blue with this action-packed classic. Bad guys beware - the Vice Squad is on your case!

146 with empty spaces and grammar stuff

114 only letters.

PostPosted: Mon Jul 05, 2010 5:59 pm
 View user's profile
 Back to top 
memyselfandI
Guest
Distraction wrote:
ok...anyone care to test the theory? using the descriptions on the back of the card?
the only way this could work...is to put the descriptions side by said...any extra spaces could throw it off..

Astro Gunner says

Rocket your way through a deadly meteor shower
with agility, speed and the mightiest firepower in the
galaxy - Astro Gunner is out of this world!

can any one else post the other card descriptions? make sure you put it down exactly how it is on the card..


well what i had tested was typing out just the descriptions back to back in a word document (including spaces between the cards individual descriptions). However we also have the ORDER of the cards that's the problem, which description goes before the next. My figures were based on total characters, so the math is there, but we have more puzzles to complete this, both KRAZBOT and VICE SQUAD have their release dates printed, any chance other people have found out the dates of the others, perhaps they are in chronological order.

PostPosted: Mon Jul 05, 2010 6:00 pm
 Back to top 
panthro13
Guest
memyselfandI wrote:

well what i had tested was typing out just the descriptions back to back in a word document (including spaces between the cards individual descriptions). However we also have the ORDER of the cards that's the problem, which description goes before the next. My figures were based on total characters, so the math is there, but we have more puzzles to complete this, both KRAZBOT and VICE SQUAD have their release dates printed, any chance other people have found out the dates of the others, perhaps they are in chronological order.


Either release date or alphabetical order....Ace Gunner -> Arc Wars -> Krazbot -> Vice Squad

PostPosted: Mon Jul 05, 2010 6:05 pm
 Back to top 
Distraction
Entrenched


Joined: 02 Apr 2008
Posts: 839
Location: Las Vegas

 		maybe its not letters we should be thinking of...but words...put the descriptions together..then use the dots to find out what word to use...

kinda like this...

Rocket your way through a deadly meteor shower Explosions about in the breakneck space
thats combining the first sentence from Astro Gunner and Arc Wars..

i hope im kinda making my point...ill play around with this a little bit and see what i can come up with...

PostPosted: Mon Jul 05, 2010 6:06 pm
 View user's profile Visit poster's website AIM Address
 Back to top 
VanGoghX
Unfettered


Joined: 09 Mar 2010
Posts: 386
Location: SoCal
memyselfandI wrote:
Distraction wrote:
ok...anyone care to test the theory? using the descriptions on the back of the card?
the only way this could work...is to put the descriptions side by said...any extra spaces could throw it off..

Astro Gunner says

Rocket your way through a deadly meteor shower
with agility, speed and the mightiest firepower in the
galaxy - Astro Gunner is out of this world!

can any one else post the other card descriptions? make sure you put it down exactly how it is on the card..


well what i had tested was typing out just the descriptions back to back in a word document (including spaces between the cards individual descriptions). However we also have the ORDER of the cards that's the problem, which description goes before the next. My figures were based on total characters, so the math is there, but we have more puzzles to complete this, both KRAZBOT and VICE SQUAD have their release dates printed, any chance other people have found out the dates of the others, perhaps they are in chronological order.
I don't think this is going to go anywhere, but what the hell. Two of the games don't have dates, so chronological would be difficult. Alphabetical, possibly?

I think we need a new overlay done of the 4 strips.
_________________
SAGODNE


PostPosted: Mon Jul 05, 2010 6:07 pm
 View user's profile
 Back to top 
Distraction
Entrenched


Joined: 02 Apr 2008
Posts: 839
Location: Las Vegas

 		and to throw my two cents out there....im for waiting too...i think there may be more out there...

but in the off chance there isnt...id like to explore a little more..just to cover the bases. ....

PostPosted: Mon Jul 05, 2010 6:14 pm
 View user's profile Visit poster's website AIM Address
 Back to top 
panthro13
Guest


 		Don't mind me:

Arc Wars -> Astro Gunner -> Krazbot -> Vice Squad Embarassed

PostPosted: Mon Jul 05, 2010 6:18 pm
 Back to top 
pcberdwin
Guest


 		I took out the black bars and only displayed the second half. Something E3


PostPosted: Mon Jul 05, 2010 8:01 pm
 Back to top 
Distraction
Entrenched


Joined: 02 Apr 2008
Posts: 839
Location: Las Vegas
pcberdwin wrote:
I took out the black bars and only displayed the second half. Something E3


it looks like EC CODE 3 to me

PostPosted: Mon Jul 05, 2010 8:14 pm
 View user's profile Visit poster's website AIM Address
 Back to top 
Bruceoite
Boot

Joined: 01 Mar 2010
Posts: 49

 		Hey guys. Just got home from vacation and found a Kraz-bot postcard in my mailbox. Here is the text from the back. I am in Chicago and my card was postmarked June 29th.

Kraz-BoT!
Combining android technology, human dexterity and fast-paced adventure, Kraz-Bot shocked the video gaming world upon its release in 1983. Thanks to the visionaries at Encom, this title is programmed to thrill!

PostPosted: Mon Jul 05, 2010 8:42 pm
 View user's profile
 Back to top 
davidnorell
Boot

Joined: 02 Jul 2010
Posts: 50
Distraction wrote:
pcberdwin wrote:
I took out the black bars and only displayed the second half. Something E3


it looks like EC CODE 3 to me


ONE OF THE RESULTS IN PDF. COPIED AND PASTED BELOW.


IEEE TRANSACTIONS ON COMPUTERS, VOL. 45, NO. 5, MAY 1996 607
An Improvement on Constructions
of GECIAUED Codes
Rajendra S. Katti and Mario Blaum
Abstract-A common method of constructing f-error correcting/all
unidirectional error detecting (t-ECIAUED) codes is to choose a tEC
code and then to append a tail such that the new code can detect all
unidirectional errors. The tail is a function of the weight of the
codeword. We present a technique to reduce the weight distribution of
the CEC code so that the tail needed will be shorter in some cases.
The weight distribution span of the code is reduced by eliminating the
all-zero codeword and replacing it with a codeword of weight greater
than 2t+ 1.
Index Terms- Decoding, descending tail matrix, encoding, error
correcting codes, unidirectional errors, unidirectional error detecting
codes.
4
1 INTRODUCTION
THE problem of constructing error correcting/all unidirectional
error detecting codes has received wide attention in recent literature
ill, 121, [31, 141, 151, 161, [7], [SI. Applications of these codes are in
fault detection and correction in memory systems. In this paper we
restrict ourselves to code construction only. Further motivation
and background can be found in [21.
Let X and Y be two n-tuples over GF(2). We denote the number
of coordinates in which X is 1 and Y is 0 by N(X, Y). For instance, if
X = 10100 and Y = 12001, then N(X, Y) = 1 and N(Y, X) = 2. Notice
that the Hamming distance between X and Y is N(X, Y) + N(Y, X).
The next theorem [41, [71 gives necessary and sufficient conditions
for t-ECIAUED codes.
THEOREM1 .1.A code C is a t-EC/AUED code if and only if, for all
distinct X, Y E C, N(X, Y) t t + 1 and N(Y, X) t t + 1.
Next, we describe the most common method of constructing
t-EC/AUED codes 131. The first step is to choose a t-EC code. Given
k information bits, this would result in an [m, k, 2t + 11 code, where
m is the length of the t-EC code and 2t + 1 is its minimum distance.
The second step is to append a tail of length r to each codeword such
that the code can detect all unidirectional errors. The length of the code is
then, n = m + r. The tail is a function of the weight of the codeword.
In this paper, we present a method to decrease Y in some cases
by reducing the weight distribution span of the code. The method
is particularly efficient for small values of m and relatively large
values oft.
Next we define the tail matrix used to construct a t-ECIAUED
code [3].
DEFINITIO1N.1 [TAILM ATRIX1.A descending tail matrix of strength
s is a p x r {O, 11 - matrix with rows ti, 0 5 i I p - 1, suck that
for all 0 I i< j I Q - 1,
N(t,, ti) t min {s, Tcj - i)/21.
R. Katti is with the Department of Electrical Engineering, North Dakota
E-mail: knttiSPLATpfains.riodak.~du.
M. Blaum is with the 1BM Research Division, Almaden Research Center,
State University, Fargo, ND 58105.
650 Harry Road, San lose, CA 95120
E-mail: blaumSPLATalmaden.ibm.com.
Manuscript received Sept. 1,1994; Yevised Feb. 28,1995.
For information on obtaining reprints of this article, please send e-mail to:
transactions@compl*ter.org, and reference IEEECS Log Number C95169.
We denote a p x Y descending tail matrix of strength s by T(p, r; s).
The next construction [3] provides a method for constructing
t-EC/AUED codes.
CONSTRUCTI1O.1N [ t-EC/AUEDC ODES]. Let C'be a t-EC code of
length m and let T be a T(m + 1, r; t + 1) descending tail matrix
with rows to, t,, , . ,, t,. Let C be the fiillowing code of length m + r:
c = {(v, t&,) : v E C')
where w(v) denotes the Hamming weight of v. Then C is a
t-EC/AUED code.
In 111, two techniques to reduce r in some cases were given. In
this paper we give a third technique to further reduce r. The
method relies on the replacement of the all-0 codeword with
another codeword, which reduces the weight distribution span of
the code in 2t + 1.
The next section describes the construction of the t-EC/AUED
code.
2 CODE CONSTRUCTION
The construction described in this section depends on the
replacement of the all-zero codeword by a codeword of
weight rm/21 in code C: The next algorithm gives the encoding
procedure:
ALGORITH2M.1 [ENCODINGP ROCEDURE]. Let k be the number of
information bits. Choose an [m, k + 1,2t + 11 systematic code C'
containin the all - 1 vector with in as small as possible and a
T(r m / 2 f- 2t, r; f + 1) descending tail matrix T with rows ti, 0
5 i 5 m/2 - 2t - 1, and r as small as possible. If g is an information
vezctor of length k, then is encoded as follows:
If g # 0,.le t CEC' be the encoding of (g,0) in C: If
W(C) 5 Lrn / 21 then encode g as c , otherwise encode it as
If = 0, then encode g as a (fixed) c E C' of weight [m / 21
such that c does not belong in the set of codewords obtained
in step 1.
Append to the vector c obtained in steps 1 or 2 the tail
tw(ij-2f+cl,o mpleting the encoding.
t 1 0 .c_ (in words, as the complement of c 1.
Notice that (3 is t-EC/AUED since a subset of C'is also t-EC. The
main difference between the first construction in [l] or the construction
in [5J and the above construction is the replacement of the all-0
codeword from C' with another codeword. This results in a
T([m / 21 - 2t, r; t + 1) matrix instead of a T(Lm / 21+l,r; t + 1)
matrix. If m is even, since we are using oidy half of the codewords of
C'in Algorithm 2.1, then, in particular, half of the codewords of
weight m/2 are not assigned to information vectors and one of them
can be chosen to encode the all-zero vector. If m is odd then no
codeword of weight [m / 21 is assigned to an information vector
and any codeword with that weight can be chosen to represent the
all-zero vector. The next example illustrates the construction
method.
EXAMPLE 2.1. Assume that k = 3 and 1: = 1. Consider the [7, 4, 31
Hamming code with systematic generator matrix
0018-9340/96$05.00 01996 IEEE
608
2
3
3
IEEE TRANSACTIONS ON COMPUTERS, VOL. 45, NO. 5, MAY 1996
238 255 13 268 269
4 15 1 16 19
11 23 3 26 29
The codewords with weight at most 3 are
0000000
1000011
0100101
0010110
1001 100
0101010
0011001
1110000
We replace the all zero codeword above by the codeword
0001111 which has weight 4. Using the descending tail matrix
T(2,1.;2)=[Smile, we obtain the code p e n by the following
codewords:
1000011 1
0100101 1
0010110 1
1001100 1
0101010 1
0011001 1
1110000 1
0001111 0
This code improves by one bit the code obtained in 151.
For instance, if we want to encode 011, it gives in a first
step the vector 0110011. This vector has weight 4, so we
take its complement, that is, 1001100, which has weight 3.
We complete the encoding by adding the tail 1, so the final
encoded vector is 10011001.
We observe in this example that the same result would
have been obtained if an [S, 4,4] extended Hamming code
was used. Notice that the codewords above are codewords
of weight 4 in the [8,4,4]ex tended Hamming code.
The decoding algorithm is essentially as in [51, with an extra step to
r e c o p e the A4 information vector. The methods in [11,[31,[51 as well as
om method, use different weight spans. No single method is the best in all
cases. Which method gives the best result in term of total redundancy (or,
with the smallest overall value of n) depends on the partidar value of k
and on the descending tail matrices available. For instance, Table D: in [l]
provides the parameters of some of the best descending tal matrices
known. Our method often ties the best known values of n for a given k,
and sometimes it even improves those values. Some values of n obtained
by our method improving those in [11 are p e n in Table 1. The values of r
were taken from Table E in [l], except for f = 2 and k = 238 and for t = 4
and k = 98, in which the value of r were taken from Table VI in 151. Notice
that the values from Table IX in [11 have a quite linuted range. Very hkely,
we can find other values of k for which ow method improves or ties the
existing ones once larger parameters for descending tail matrices are provided.
The requirement that code C' is systematic is not necessary, but it
makes the encoding and decoding easier (in any case, all linear codes have
a systematic representation). We use BCH codes (or shortened BCH
codes) in all cases, except for t = 3 and k = 11, in which we use the Golay
code. There is akc an implicit assumption that codewords of weight rrn / 21
exist, but tlvs is always the case with BCH codes and the Golay code [9].
3
3
3
4
4
TABLE 1
SOME VALUES OF TANDK
FOR WHICH OUR METHOD IMPROVES THE ONES IN [I]
10 15 18 19
25 31 36 37
2 6 15 2 17 19
2 20 31 6 37 38
15 31 5 36 39
44 63 9 72 74
105 127 14 141 142
51 80 11 91 92
98 127 17 144 145
3 CONCLUSION
We conclude this paper by showing how saving even one bit in a
t-ECIAUED code results in great savings in the cost of a memory
system using such a code. Consider a memory system consisting
of 2" words. Let each word in memory be a codeword in the
3-EC/AUED code with k = 15 whose parameters are given in
Table 1. In this case our code results in a codeword length of 36
bits whereas the construction in [l] gives a codeword length of 39
bits. Therefore, the memory system using our code would have 3 x 215
bits less than the memory system using the code in [ll resulting in
considerable savings in the cost of the memory system.
REFERENCES
S. AI-Bassam and B. Bose,, "Aymmetric/Unidirectional Error
Correcting and Detecting Codes," IEEE Trans. Computers, vol. 43,
no. 5, pp. 590-597, May 1994.
M. Blaum, Codes for Detecting and Correcting Unidirectional Errors
(reprint collection), IEEE Computer Society Press. 1993.
M. Blaum and H. van Tilborg, "On t-Error Correcting/All Unidirectional
Error Detecting Codes," IEEE Trans. Computers, vol. 38,
no. 11, pp. 1,493-1,501, Nov. 1989.
B. Bose and T.R.N. Rao, "On the Theory of Error Correcting/Detecting
Codes," E E E Trans. Computers, vol. 31, no. 6, pp. 521-530, June
1982.
J. Bruck and M. Blaum, "New Techniques for Constructing
EC/AUED Codes," JEEE Trans. Computers, vol. 41, no. 10,
D. Nikolos, N. Gaitanis, and G. Philokyprou, "Systematic t-Error
Correcting/All Unidirectional Error Detecting Codes," IEEE
Trans. Computers, vol. 35, no. 5, pp. 394-402, May 1986.
D.K. Pradhan, "A New Class of Error Correcting/Detecting
Codes for Fault-Tolerant Computer Applications," IEEE Trans.
Computers, vol. 29, no. 6, pp. 471-481, June 1980.
D.L. Tao, C.R.P. Hartmann, and P.K. Lala, "An Efficient Class of
Unidirectional Correcting/Detecting Codes," IEEE Trans. Computevs,
vol. 37, no. 7, pp. 879-882, July 1988.
F.J. MacWilliams and N.J.A. Sloane, The Theovy of Error-Correcting
Codes, North-Holland. 1978.

PostPosted: Mon Jul 05, 2010 8:44 pm
 View user's profile
 Back to top 
VanGoghX
Unfettered


Joined: 09 Mar 2010
Posts: 386
Location: SoCal

 		So what you're saying is... and correct me if I'm wrong...


Ctrl-C, Ctrl-V? Wink
_________________
SAGODNE


PostPosted: Mon Jul 05, 2010 8:58 pm
 View user's profile
 Back to top 
Display posts from previous:   Sort by:   
Page 46 of 69 [1032 Posts]   Goto page: Previous 1, 2, 3, ..., 44, 45, 46, 47, 48, ..., 67, 68, 69  Next
View previous topicView next topic
 Forum index » Chaotic Fiction » Flynn Lives
Jump to:  


You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot vote in polls in this forum
You cannot attach files in this forum
You can download files in this forum
You cannot post calendar events in this forum



Powered by phpBB © 2001, 2005 phpBB Group