Abstract: Systems and methods consistent with the present invention encode a list so users of the list may make inquiries to the coded list without the entire content of the list being revealed to the users. Once each item in the list has been encoded by an encoder, a bit array with high and low values may be used to represent the items in the list. The bit array may be embodied in a validation system for allowing users to query the list to determine whether an inquiry item is on the list. The validation system determines which bits to check by executing the same coding process executed by the encoder. If all the bits are high, then the inquiry item is determined to be part of the list, if at least one bit is low, then the inquiry item is determined not to be part of the original list.

Abstract: Systems and methods maintain a database of recipient names and addresses where the delivery point addresses contain secondary address. Data that is stored in the database may be arrayed in secure data tables. The structure of the secure data tables ensures that the data is secure and prevents an unauthorized user from learning address information improperly. A delivery service provider may create secure data tables using 20-byte Secure Hash Algorithm. A software searches secure data tables for the matching recipient name and address. If the match is found, a business sender may receive valid secondary address information for that recipient. If, however, a database does not contain a matching recipient name and address, a business sender may not receive any further information about that recipient's address.

Abstract: A method and system for efficiently retrieving secured data by securely pre-processing provided access information, provides data store security based on a single piece of access information, which is generally public, such as the proper name of a business or individual that is used to retrieve mailing address information. The access information is hashed for access to a secured data store and efficient access and low data storage for permutations of input access information are provided by verifying the presence of an entry for the hashed access information in a look-up table. If an entry is found, the data store is accessed using the hashed access information, but if an entry is not found, another look-up table corresponding to another information type may be tried or the input access information permuted and retried.

Abstract: Systems, methods, and software consistent with the present invention use combinations of two or more letters (xgraphs) or characters, such as three letter combinations (trigraphs), to aid in deciphering ambiguous characters in OCR systems. Embodiments consistent with the invention compare possible xgraphs constructed by substitution for the ambiguous OCR-read character(s) to a reference set of xgraphs. The reference set of xgraphs contains predetermined valid xgraphs, which may be ranked by preference. If a possible xgraph matches a reference xgraph, then the ambiguous character(s) are resolved in favor of the characters in the reference xgraph. Embodiments may also use the context of the ambiguous character string to aid in resolving the ambiguity where more than one possible solution exists.

Abstract: Systems and methods consistent with the present invention encode a list so users of the list may make inquiries to the coded list without the entire content of the list being revealed to the users. Once each item in the list has been encoded by an encoder, a bit array with high and low values may be used to represent the items in the list. The bit array may be embodied in a validation system for allowing users to query the list to determine whether an inquiry item is on the list. The validation system determines which bits to check by executing the same coding process executed by the encoder. If all the bits are high, then the inquiry item is determined to be part of the list, if at least one of the bits is low, then the inquiry item is determined not to be part of the original list.

Abstract: Systems and methods are provided for determining secondary address information. In one implementation, a method is provided that uses a data processing apparatus. According to the method, a code word is created for a business name and a building default extended delivery code. A data table is searched using the code word and secondary address information is revealed when a match is found between the code word and data stored in the data table.

Abstract: A method and system for efficiently retrieving secured data by securely pre-processing provided access information, provides data store security based on only a single piece of access information, which is generally public, such as the proper name of a business or individual that is used to retrieve mailing address information. The access information is hashed for access to a secured data store and efficient access and low data storage for permutations of input access information are provided by verifying the presence of an entry for the hashed access information in a look-up table. If an entry is found, the data store is accessed using the hashed access information, but if an entry is not found, another look-up table corresponding to another information type may be tried or the input access information permuted and retried.

Abstract: A method and system for storing and retrieving data using hash-accessed multiple data stores, provides data protection while requiring low computational overhead and further provides storage and retrieval access based on only a single piece of access information, which is generally public. The algorithms provide high security against data-mining and other examination of the data stores. The access information is hashed and is split into offset fields used as indices into a plurality of data stores, generating a quasi-random relationship between the access information and the location of portions of a stored data element. Further protection may be provided by striping the data across the data stores in conformity with a striping order selected by a field of the hashed access information.

Abstract: Systems and methods maintain a database of recipient names and addresses where the delivery point addresses contain secondary address. Data that is stored in the database may be arrayed in secure data tables. The structure of the secure data tables ensures that the data is secure and prevents an unauthorized user from learning address information improperly. A delivery service provider may create secure data tables using 20-byte Secure Hash Algorithm. A software searches secure data tables for the matching recipient name and address. If the match is found, a business sender may receive valid secondary address information for that recipient. If, however, a database does not contain a matching recipient name and address, a business sender may not receive any further information about that recipient's address.

Abstract: Systems and methods for providing an alternative delivery point code may comprise receiving delivery data corresponding to a delivery point. Furthermore, the systems and methods may include determining if the delivery data includes a secondary element. Moreover, the systems and methods may include creating the alternative delivery point code based upon the secondary element if the delivery data includes the secondary element. The secondary element may comprise a descriptor or a secondary number associated with the delivery point. If the delivery data does not include the secondary element, a normal delivery point code may be created.