Re: Call For Sample Code RADIX13/RADIX55

2014-01-27 Thread Martin Truebner
Andreas, now that makes sense - >> xxx -> 'Chicago', 'New York', ... >> yyy -> dept / term-type / CU >> nn -> 01..99 2 (city codes) times 68*68*68 (the three pos with alpha-num-and some extra) times 100 (the last two numbers) That is way it is less than possible in 4 bytes. We could increase t

Re: Call For Sample Code RADIX13/RADIX55

2014-01-27 Thread DASDBILL2
lha Characteris and some special characters. My routine was expanded to include Numbers. Again the RADIX55 Routine has to knowledge of the format or the characters of the input. Paul -- Original Message -- From: John Ehrman To: ASSEMBLER-LIST@LISTSERV.UGA.EDU Subject: Re:

Re: Call For Sample Code RADIX13/RADIX55

2014-01-27 Thread Andreas F. Geissbuehler
David de Jongh is correct: You are trying to pack a field that has 36^8 (2,821,109,907,456) possible combinations into a field that has 60^4 (12,960,000) combinations. You will need a hashing algorithm. Paul states: There is No specific example, as this routine was used in many installation t

Re: Call For Sample Code RADIX13/RADIX55

2014-01-26 Thread Paul Gilmartin
On 2014-01-26, at 15:37, David de Jongh wrote: > You are trying to pack a field that has 36^8 (2,821,109,907,456) possible > combinations into a field that has 60^4 (12,960,000) combinations. You will > need a hashing algorithm. > http://en.wikipedia.org/wiki/Pigeonhole_principle -- gil

Re: Call For Sample Code RADIX13/RADIX55

2014-01-26 Thread David de Jongh
...@juno.com Sent: Sunday, January 26, 2014 8:25 AM To: ASSEMBLER-LIST@LISTSERV.UGA.EDU Subject: Re: Call For Sample Code RADIX13/RADIX55 John Ehrman wrote >Can you provide an example of a couple >of typical sets of 8 (non-hex?) input bytes and what you expect >as the corresponding 4

Re: Call For Sample Code RADIX13/RADIX55

2014-01-26 Thread Paul Gilmartin
On 2014-01-26, at 07:43, Martin Truebner wrote: > Paul, > > when you have the code in March could you post it? > > As far as I can see there is no way to store 68 possible combinations > in 4 bits - (going from 8bytes to 4bytes) > > Or is the number of combinations restricted by extra rules? i.e.

Re: Call For Sample Code RADIX13/RADIX55

2014-01-26 Thread Martin Truebner
Paul, when you have the code in March could you post it? As far as I can see there is no way to store 68 possible combinations in 4 bits - (going from 8bytes to 4bytes) Or is the number of combinations restricted by extra rules? i.e. No lowercase if numbers in itor only certain chars??? --

Re: Call For Sample Code RADIX13/RADIX55

2014-01-26 Thread esst...@juno.com
mbers. Again the RADIX55 Routine has to knowledge of the format or the characters of the input. Paul -- Original Message -- From: John Ehrman To: ASSEMBLER-LIST@LISTSERV.UGA.EDU Subject: Re: Call For Sample Code RADIX13/RADIX55 Date: Sat, 25 Jan 2014 18:36:55 -0800 Paul, yo

Re: Call For Sample Code RADIX13/RADIX55

2014-01-25 Thread John Ehrman
Paul, your description is unclear. Can you provide an example of a couple of typical sets of 8 (non-hex?) input bytes and what you expect as the corresponding 4 (non-hex??) output bytes? >Can someone provide me with sample code that uses RADIX13 or Modulo55. My Modulo55 code is burried in a stora

Call For Sample Code RADIX13/RADIX55

2014-01-24 Thread esst...@juno.com
Can someone provide me with sample code that uses RADIX13 or Modulo55. My Modulo55 code is burried in a storage locker which I wont be able to get to until March. By RADIX13 or Module 55 I mean the conversion routine that takes for example 8 Characters (non-hex) as input and converts them to 4