Hidden Goppa presentations versus public-code decoding
Statement
Given a parity-check matrix , find the hidden Goppa code in . How quickly can we decode , assuming Goppa decoder for exists?
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.