Appeal No. 96-0506 Application 07/856,001 padding said message with said predetermined set of constant bit values to provide a second symbol aligned array of bits that is identical to said first array, subject only to any decode errors that may have corrupted said message; reading out said second array in accordance with said predetermined one of said scan patterns to provide a second set of symbols that are identical to first set of symbols, subject only to any decode errors that may have corrupted said message; and computing a decode of said error correction code on said second set of symbols and said parity symbols to correct said decode errors if and when possible. THE REFERENCES The examiner relies on the following references ("primary" and "secondary" characterizations are by the examiner): Primary Okamoto et al. (Okamoto) 4,646,301 February 24, 1987 Chapman 5,181,207 January 19, 1993 (filed January 28, 1991) Secondary Cerracchio 4,375,101 February 22, 1983 Patel et al. (Patel) 4,745,604 May 17, 1988 Golden 4,868,824 September 19, 1989 Pughe, Jr. et al. (Pughe) 5,226,043 July 6, 1993 (filed December 27, 1990) THE REJECTIONS Claims 1-6 stand rejected under 35 U.S.C. § 103 as being unpatentable over Okamoto and Chapman. The examiner cites Cerracchio, Patel, Golden, and Pughe as evidence that it was well known in the art to pad bits, but does not include the references in the statement of the rejection. We refer to the Examiner's Answer for the statement of the rejection. - 3 -Page: Previous 1 2 3 4 5 6 NextLast modified: November 3, 2007